The complexity of the membership problem for some extensions of context-free languagest† (Q4181980): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207167708803138 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056449710 / rank | |||
Normal rank | |||
Revision as of 22:26, 19 March 2024
scientific article; zbMATH DE number 3619335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the membership problem for some extensions of context-free languagest† |
scientific article; zbMATH DE number 3619335 |
Statements
The complexity of the membership problem for some extensions of context-free languagest† (English)
0 references
1977
0 references
Extensions of Context-Free Languages
0 references
Complexity
0 references
Membership Problem
0 references
Recognition Problem
0 references
Pushdown Automata
0 references
Eol Languages
0 references
Edol Languages
0 references
Homomorphic Replication
0 references
Regular Set
0 references
State Grammars
0 references
Vector Grammars
0 references
