Two-Sided Strictly Locally Testable Languages

DOI10.3233/FI-2021-2033OpenAlexW3162899379MaRDI QIDQ5164867

Markus Holzer, Martin Kutrib, Friedrich Otto

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2021-2033

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Membership for growing context-sensitive grammars is polynomial
• Local languages and the Berry-Sethi algorithm
• Learning regular sets from queries and counterexamples
• Grammatical inference for even linear languages based on control sets
• Families of locally testable languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Lower bound technique for length-reducing automata
• Locally testable languages
• Linear Context Free Languages
• Church-Rosser Thue systems and formal languages
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• On a family of linear grammars
• A machine realization of the linear context-free languages
• Language identification in the limit