Recognition of deterministic ETOL languages in logarithmic space

DOI10.1016/S0019-9958(77)90058-4zbMATH Open0374.68050OpenAlexW1963916956MaRDI QIDQ4151735FDOQ4151735

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

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

Cited In (5)

• Parallel complexity of iterated morphisms and the arithmetic of small numbers
• 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

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)