GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS

DOI10.1142/S0129054110007520zbMath1207.68173OpenAlexW2132669525MaRDI QIDQ3056275

Ralf Stiebe, Bianca Truthe, Juergen 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

tree controlled grammarsgenerative capacitysubregular control languages

Mathematics Subject Classification ID

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

Related Items (8)

On the Nonterminal Complexity of Tree Controlled Grammars ⋮ Networks of evolutionary processors: the power of subregular filters ⋮ Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ On external contextual grammars with subregular selection languages ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Remarks on external contextual grammars with selection ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity

Cites Work

• Unnamed Item
• Tree controlled grammars
• On the generative capacity of tree controlled grammars

This page was built for publication: GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS