Tree controlled grammars

DOI10.1007/BF02252350MaRDI QIDQ1240570zbMATH OpenFDO

Authors Karel II Culik, Hermann Maurer

Publication date 1977

Published in Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3493903 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3324737 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language

Cited in

(12)

• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Conclusive tree-controlled grammars
• Nonterminal complexity of tree controlled grammars
• Uniform rewriting based on permutations
• On the generative capacity of tree controlled grammars
• Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
• Generative capacity of subregularly tree controlled grammars
• On the nonterminal complexity of tree controlled grammars
• Two collapsing hierarchies of subregularly tree controlled languages
• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• Tree-controlled grammars with restrictions placed upon cuts and paths

This page was built for publication: Tree controlled grammars

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