Merging two hierarchies of external contextual grammars with subregular selection

DOI10.1007/978-3-031-34326-1_13OpenAlexW4381895719MaRDI QIDQ6175098

Bianca Truthe

Publication date: 17 August 2023

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34326-1_13

zbMATH Keywords

subregular selection languagescomputational capacitycontextual grammars

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On external contextual grammars with subregular selection languages
• Quotient complexity of closed languages
• Multiple-entry finite automata
• On Internal Contextual Grammars with Subregular Selection Languages
• Power-separating regular languages
• Generative Capacity of Contextual Grammars with Subregular Selection Languages*
• On Subregular Selection Languages in Internal Contextual Grammars.
• On Contextual Grammars with Subregular Selection Languages
• The Theory of Definite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Merging two hierarchies of external contextual grammars with subregular selection