Over testable languages
- 1 July 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 161 (1-2) , 157-190
- https://doi.org/10.1016/0304-3975(95)00100-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Relatively Free Profinite Monoids: An Introduction and ExamplesPublished by Springer Nature ,1995
- Languages and scannersTheoretical Computer Science, 1991
- Implicit operations on finite J-trivial semigroups and a conjecture of I. SimonJournal of Pure and Applied Algebra, 1991
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topicsAlgebra universalis, 1990
- On the varieties of languages associated with some varieties of finite monoids with commuting idempotentsInformation and Computation, 1990
- The algebra of implicit operationsAlgebra universalis, 1989
- The Birkhoff theorem for finite algebrasAlgebra universalis, 1982
- On pseudovarietiesAdvances in Mathematics, 1976
- Algebraic decision procedures for local testabilityTheory of Computing Systems, 1974
- Characterizations of locally testable eventsDiscrete Mathematics, 1973