Right and left locally testable languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3910655 (Why is no real title available?)
- scientific article; zbMATH DE number 4037246 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- Algebraic decision procedures for local testability
- Characterizations of locally testable events
- Graph congruences and wreath products
- Languages and scanners
- Locally testable languages
- Over testable languages
Cited in
(9)- A sufficient condition to polynomially compute a minimum separating DFA
- Bilateral locally testable languages.
- Two-Sided Strictly Locally Testable Languages
- Grammatical Inference: Algorithms and Applications
- Some variations on the notion of locally testable language
- Right and left strongly locally testable semigroups and languages
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
- scientific article; zbMATH DE number 3881894 (Why is no real title available?)
- On two-sided locally testable languages
This page was built for publication: Right and left locally testable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583588)
