Over testable languages

DOI10.1016/0304-3975(95)00100-XzbMath0872.68092OpenAlexW2044939741MaRDI QIDQ1351950

Carla Selmi

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00100-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Bilateral locally testable languages. ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ Strongly locally testable semigroups with commuting idempotents and related languages ⋮ Free profinite locally idempotent and locally commutative semigroups ⋮ Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups ⋮ Right and left locally testable languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• On the varieties of languages associated with some varieties of finite monoids with commuting idempotents
• The algebra of implicit operations
• The Birkhoff theorem for finite algebras
• Languages and scanners
• On pseudovarieties
• Locally testable semigroups
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
• Locally testable languages
• Characterizations of locally testable events
• Algebraic decision procedures for local testability
• Reducibility vs. definability for pseudovarieties of semigroups