Piecewise and local threshold test ability of DFA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2138, Issue , 2001, Pages 347-358

  Trahtman, A N ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Algorithm; Automaton; Locally testable; Locally threshold testable; Piecewise testable; Syntactic semigroup; Transition graph

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; SYNTACTICS;

AUTOMATON; LOCALLY TESTABLE; LOCALLY THRESHOLD TESTABLE; PIECE-WISE; SEMI-GROUP; TRANSITION GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 84974691385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_33     Document Type: Conference Paper

References (19)

1. M.-P. Beal, J. Senellart, On the bound of the synchronization delay of local automata, Theoret. Comput. Sci. 205, 1-2(1998), 297-306.
2. D. Beauquier, J.E. Pin, Factors of words, Lect. Notes in Comp. Sci. Springer, Berlin, 372(1989), 63-79.
3. D. Beauquier, J.E. Pin, Languages and scanners, Theoret. Comp. Sci. 1, 84(1991), 3-21.
4. J.-C. Birget, Strict local testability of the finite control of two-way automata and of regular picture description languages, J. of Alg. Comp. 1, 2(1991), 161-175.
5. J.A. Brzozowski, I. Simon, Characterizations of locally testable events, Discrete Math. 4, (1973), 243-271.
6. P. Caron, LANGAGE: A Maple package for automaton characterization of regular languages, Springer, Lect. Notes in Comp. Sci. 1436(1998), 46-55.
7. P. Caron, Families of locally testable languages, Theoret. Comput. Sci., 242(2000), 361-376.
8. T. Head, Formal languages theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biol. 49(1987), 4, 739-757.
9. F. Hinz, Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats, Springer, Lect. Notes in Comp. Sci. 349(1990), 132-143.
10. S. Kim, R. McNaughton, R. McCloskey, A polynomial time algorithm for the local testability problem of deterministic finite automata, IEEE Trans. Comput. 40(1991) N10, 1087-1093.
11. R. McNaughton, S. Papert, Counter-free automata M.I.T. Press. Mass., 1971.
12. J. Pin, Finite semigroups and recognizable languages. An introduction, Semigroups and formal languages, Math. andPh. Sci. 1466(1995), 1-32.
13. J. Ruiz, S. Espana, P. Garcia, Locally threshold testable languages in strict sense: Application to the inference problem. Springer, Lect. Notes in Comp. Sci 1433(1998), 150-161.
14. J. Stern, Complexity of some problems from the theory of automata. Inf. and Control, 66(1985), 163-176.
15. I. Simon, Piecewise testable events, Springer, Lect. Notes in Comp. Sci., 33(1975), 214-222.
16. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1(1972), 146-160. J. of Comp. System Sci. 25(1982), 360-376.
17. A.N. Trahtman, A polynomial time algorithm for local testability and its level. Int. J. of Algebra andComp. v. 9, 1(1998), 31-39.
18. A.N. Trahtman, A precise estimation of the order of local testability of a deterministic finite automaton, Springer, Lect. Notes in Comp. Sci. 1436(1998), 198-212.
19. E. Vidal, F. Casacuberta, P. Garcia, Grammatical inference and automatic speech recognition. In speech recognition and coding Springer, 1995, 175-191.