On the complexity of regulated context-free rewriting

DOI10.1016/S0019-9958(74)90755-4MaRDI QIDQ4404468zbMATH OpenOpenAlexFDO

Authors

Publication date 1974

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

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

Mathematics Subject Classification ID

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

Cited in

(5)

• On the family of finite index matrix languages
• On coupled languages and translations
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Nonterminal complexity of tree controlled grammars

This page was built for publication: On the complexity of regulated context-free rewriting

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