A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
AUTOMATE, a computing package for automata and finite semigroups
Journal of Symbolic Computation
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Algorithms for computing finite semigroups
FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Families of locally testable languages
Theoretical Computer Science
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Right and left locally testable languages
Theoretical Computer Science
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Computing the Order of a Locally Testable Automaton
Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science
LANGAGE: A Maple Package for Automaton Characterization of Regular Languages
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Whale calf, a parser generator for conjunctive grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Reducing the time complexity of testing for local threshold testability
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
COMPAS: a computing package for synchronization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
On the state and computational complexity of the reverse of acyclic minimal DFAs
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We implement a set of procedures for deciding whether or not a language given by its minimal automaton or by its syntactic semigroup is locally testable, right or left locally testable, threshold locally testable, strictly locally testable, or piecewise testable. The bounds on order of local testability of transition graph and order of local testability of transition semigroup are also found. For given k, the k-testability of transition graph is verified. Some new effective polynomial time algorithms are used. These algorithms have been implemented as a C/C++ package.