The tape-complexity of context-independent developmental languages

DOI10.1016/S0022-0000(75)80068-7zbMath0314.68017OpenAlexW2083228096MaRDI QIDQ1220791

Jan van Leeuwen

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80068-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Pattern selector grammars and several parsing algorithms in the context- free style, Complexity of EOL structural equivalence, Complexity of E0L structural equivalence, Unnamed Item, The complexity of the membership problem for some extensions of context-free languagest†, Complexity of some problems concerningL systems

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Recognition and parsing of context-free languages in time n3
• Studies in abstract families of languages
• A biologically motivated extension of ALGOL-like languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item