Relations of contextual grammars with strictly locally testable selection languages

DOI10.1051/ita/2023012arXiv2208.14725OpenAlexW4388641234MaRDI QIDQ6186541

Bianca Truthe, Juergen Dassow

Publication date: 2 February 2024

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.14725

zbMATH Keywords

contextual grammarsexternal and internal derivation modesselection languagessubregular families of languages

Mathematics Subject Classification ID

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

Cites Work

• On external contextual grammars with subregular selection languages
• Quotient complexity of closed languages
• Multiple-entry finite automata
• Remarks on external contextual grammars with selection
• From Regular to Strictly Locally Testable Languages
• Power-separating regular languages
• On Subregular Selection Languages in Internal Contextual Grammars.
• The Theory of Definite Automata
• Aspects of Molecular Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relations of contextual grammars with strictly locally testable selection languages