Two-Sided Strictly Locally Testable Languages
From MaRDI portal
Publication:5164867
DOI10.3233/FI-2021-2033OpenAlexW3162899379MaRDI QIDQ5164867FDOQ5164867
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
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
- Title not available (Why is that?)
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Language identification in the limit
- Title not available (Why is that?)
- Membership for growing context-sensitive grammars is polynomial
- Church-Rosser Thue systems and formal languages
- Local languages and the Berry-Sethi algorithm
- Locally testable languages
- On a family of linear grammars
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- Title not available (Why is that?)
- Families of locally testable languages
- Lower bound technique for length-reducing automata
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- Linear Context Free Languages
- Grammatical inference for even linear languages based on control sets
- A machine realization of the linear context-free 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)
