Two-Sided Strictly Locally Testable Languages

DOI10.3233/FI-2021-2033MaRDI QIDQ5164867zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On two-sided locally testable languages
• From regular to strictly locally testable languages
• From regular to strictly locally testable languages
• On generalized locally testable languages
• scientific article; zbMATH DE number 2050939
• Right and left locally testable languages
• Some variations on the notion of locally testable language
• Bilateral locally testable languages.
• scientific article; zbMATH DE number 1507233
• Families of locally testable languages

Cites work

• scientific article; zbMATH DE number 3856413 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• A machine realization of the linear context-free languages
• Church-Rosser Thue systems and formal languages
• Families of locally testable languages
• Grammatical inference for even linear languages based on control sets
• Language identification in the limit
• Learning regular sets from queries and counterexamples
• Linear Context Free Languages
• Local languages and the Berry-Sethi algorithm
• Locally testable languages
• Lower bound technique for length-reducing automata
• Membership for growing context-sensitive grammars is polynomial
• On a family of linear grammars
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Cited in

(6)

• On generalized locally testable languages
• Bilateral locally testable languages.
• STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
• Right and left strongly locally testable semigroups and languages
• On two-sided locally testable languages
• On separation by locally testable and locally threshold testable languages

This page was built for publication: Two-Sided Strictly Locally Testable Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164867)