Recognition of deterministic ETOL languages in logarithmic space

DOI10.1016/S0019-9958(77)90058-4MaRDI QIDQ4151735zbMATH OpenOpenAlexFDO

Authors Neil D. Jones, Sven Skyum

Publication date 1977

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(77)90058-4

Mathematics Subject Classification ID

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

Cited in

(6)

• Pattern selector grammars and several parsing algorithms in the context- free style
• Extending regular expressions with homomorphic replacement
• Complexity of some problems concerningL systems
• Time and space complexity of inside-out macro languages
• Parallel complexity of iterated morphisms and the arithmetic of small numbers
• Maximal universal width of an AFA is NP-hard

This page was built for publication: Recognition of deterministic ETOL languages in logarithmic space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151735)