Generative capacity of subregularly tree controlled grammars

DOI10.1142/S0129054110007520MaRDI QIDQ3056275zbMATH OpenOpenAlexFDO

Authors Ralf Stiebe, Bianca Truthe, Jürgen Dassow

Publication date 11 November 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054110007520

zbMATH Keywords

generative capacitysubregular control languagestree controlled grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Two collapsing hierarchies of subregularly tree controlled languages
• On the nonterminal complexity of tree controlled grammars
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• scientific article; zbMATH DE number 4062631

Cites work

• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• On the generative capacity of tree controlled grammars
• Tree controlled grammars

Cited in

(24)

• Abstract grammars based on transductions
• Remarks on external contextual grammars with selection
• The tree-generative capacity of combinatory categorial grammars
• Two collapsing hierarchies of subregularly tree controlled languages
• Networks of evolutionary processors: the power of subregular filters
• Tree-controlled grammars with restrictions placed upon cuts and paths
• Conditional Lindenmayer systems with conditions defined by bounded resources
• Parsing based on n-path tree-controlled grammars
• On the nonterminal complexity of tree controlled grammars
• Bag context tree grammars
• Bag Context Tree Grammars
• scientific article; zbMATH DE number 4062631 (Why is no real title available?)
• scientific article; zbMATH DE number 39880 (Why is no real title available?)
• On external contextual grammars with subregular selection languages
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• scientific article; zbMATH DE number 1836410 (Why is no real title available?)
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Non-self-embedding linear context-free tree grammars generate regular tree languages
• Grammars with control by ideals and codes
• Control sets on grammars
• The Tree-Generative Capacity of Combinatory Categorial Grammars.
• Tree generating context-free grammars and regular tree grammars are equivalent
• Conclusive tree-controlled grammars
• Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars

This page was built for publication: Generative capacity of subregularly tree controlled grammars

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