On the complexity of regulated context-free rewriting

DOI10.1016/S0019-9958(74)90755-4zbMath0278.68077OpenAlexW2064904616MaRDI QIDQ4404468

No author found.

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)

Related Items (5)

Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ On coupled languages and translations ⋮ Nonterminal complexity of tree controlled grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ On the family of finite index matrix languages

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