Right and left locally testable languages

DOI10.1016/S0304-3975(99)00108-5zbMath0959.68072MaRDI QIDQ1583588

R. Smith

Publication date: 31 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

varieties of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Bilateral locally testable languages. ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data

Cites Work

• Languages and scanners
• Over testable languages
• Graph congruences and wreath products
• Locally testable languages
• Characterizations of locally testable events
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Algebraic decision procedures for local testability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item