On two-sided locally testable languages
From MaRDI portal
Recommendations
Cites work
- A machine realization of the linear context-free languages
- Church-Rosser Thue systems and formal 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
- Lower bound technique for length-reducing automata
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On a family of linear grammars
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
Cited in
(9)- Bilateral locally testable languages.
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
- Right and left strongly locally testable semigroups and languages
- On separation by locally testable and locally threshold testable languages
- scientific article; zbMATH DE number 3881894 (Why is no real title available?)
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
- Graph congruences and pair testing
- Two-Sided Strictly Locally Testable Languages
- On generalized locally testable languages
This page was built for publication: On two-sided locally testable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988164)
