On linear context-free languages and one-way multihead automata (Q1061497)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On linear context-free languages and one-way multihead automata |
scientific article; zbMATH DE number 3911745
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On linear context-free languages and one-way multihead automata |
scientific article; zbMATH DE number 3911745 |
Statements
On linear context-free languages and one-way multihead automata (English)
0 references
1984
0 references
We design an algorithm recognizing linear context-free languages in \(O(n^ 2/\log^ 2n)\) time on RAM.
0 references
time complexity
0 references
language recognition
0 references
algorithm
0 references
linear context-free languages
0 references
RAM
0 references
