Tree controlled grammars

DOI10.1007/BF02252350zbMath0363.68108MaRDI QIDQ1240570

Hermann Maurer, Karel II Culik

Publication date: 1977

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

On the Nonterminal Complexity of Tree Controlled Grammars ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two collapsing hierarchies of subregularly tree controlled languages ⋮ Nonterminal complexity of tree controlled grammars ⋮ GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ On the generative capacity of tree controlled grammars ⋮ Unnamed Item ⋮ Uniform rewriting based on permutations

Cites Work

• A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree controlled grammars