Families of locally testable languages
Author:
- Pascal CaronPCPascal Caron
- 1 July 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 242 (1-2) , 361-376
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- LANGAGE: A Maple package for automaton characterization of regular languages1998
- AG: A set of Maple Packages for Manipulating Automata and SemigroupsSoftware: Practice and Experience, 1997
- Local languages and the Berry-Sethi algorithmTheoretical Computer Science, 1996
- Languages and scannersTheoretical Computer Science, 1991
- A polynomial time algorithm for the local testability problem of deterministic finite automataIEEE Transactions on Computers, 1991
- Codes circulaires, automates locaux et entropieTheoretical Computer Science, 1988
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroupInformation and Control, 1980
- Algebraic decision procedures for local testabilityTheory of Computing Systems, 1974
- Characterizations of locally testable eventsDiscrete Mathematics, 1973
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968