A polynomial time algorithm for the local testability problem of deterministic finite automata
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 420-436
- https://doi.org/10.1007/3-540-51542-9_35
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Complexity of some problems from the theory of automataInformation and Control, 1985
- Characterizations of some classes of regular eventsTheoretical Computer Science, 1985
- Computational Parallels between the Regular and Context-Free LanguagesSIAM Journal on Computing, 1978
- Algebraic decision procedures for local testabilityTheory of Computing Systems, 1974
- Book announcementsDiscrete Mathematics, 1973
- Locally testable languagesJournal of Computer and System Sciences, 1972
- Fault Detection in Iterative Logic ArraysIEEE Transactions on Computers, 1971