On external contextual grammars with subregular selection languages

DOI10.1016/J.TCS.2012.04.008zbMath1279.68146OpenAlexW2072650267MaRDI QIDQ443738

Florin Manea, Bianca Truthe, Juergen Dassow

Publication date: 13 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.008

zbMATH Keywords

external contextual grammarssubregular selection languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Descriptive complexity and finite models (68Q19)

Related Items (7)

Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources ⋮ Unnamed Item ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ Unnamed Item ⋮ Generative Capacity of Contextual Grammars with Subregular Selection Languages* ⋮ Remarks on external contextual grammars with selection

Cites Work

• State complexity of basic operations on suffix-free regular languages
• Marcus contextual grammars
• Determination of finite automata accepting subregular languages
• Networks of Evolutionary Processors with Subregular Filters
• GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS
• Quotient Complexity of Ideal Languages
• Complexity in Union-Free Regular Languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On external contextual grammars with subregular selection languages