Reducing the time complexity of testing for local threshold testability

Theoretical Computer Science

Volumn 328, Issue 1-2, 2004, Pages 151-160

  Trahtman, A N ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Algorithm; Automaton; Graph; Threshold locally testable

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; FORMAL LANGUAGES; GRAPH THEORY; POLYNOMIALS; SET THEORY; STATISTICAL TESTS;

AUTOMATON; FINITE AUTOMATON; NON-NEGATIVE INTEGERS; THRESHOLD LOCALLY TESTABLE;

THRESHOLD LOGIC;

EID: 9544252205     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.011     Document Type: Conference Paper

References (17)

1. D. Beauquier, J.E. Pin, Factors of Words, Lecture Notes in Computer Science, Vol. 372, Springer, Berlin, 1989, pp. 63-79.
2. J.A. Brzozowski, I. Simon, Characterizations of locally testable events, Discrete Math. 4 (1973) 243-271.
3. P. Caron, LANGAGE: A Maple Package for Automaton Characterization of Regular Languages, Lecture Notes in Computer Science, Vol. 1436, Springer, Berlin, 1998, pp. 46-55.
4. P. Caron, Families of locally testable languages, Theoret. Comput. Sci. 242 (2000) 361-376.
5. S. Kim, R. McNaughton, Computing the order of a locally testable automaton, SIAM J. Comput. 23 (1994) 1193-1215.
6. S. Kim, R. McNaughton, R. McCloskey, A polynomial time algorithm for the local testability problem of deterministic finite automata, IEEE Trans. Comput. 10 (40) (1991) 1087-1093.
7. R. McNaughton, S. Papert, Counter-free Automata, MIT Press, Cambridge, MA, 1971.
8. J. Ruiz, S. Espana, P. Garcia, Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem, Lecture Notes in Computer Science, Vol. 1433, Springer, Berlin, 1998, pp. 150-161.
9. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160.
10. D. Thérien, A. Weiss, Graph congruences and wreath product, J. Pure Appl. Algebra 35 (1985) 205-215.
11. A.N. Trahtman, A polynomial time algorithm for local testability and its level, Internat. J. Algebra Comput. 9 (1) (1998) 31-39.
12. A.N. Trahtman, Algorithms finding the order of local testability of deterministic finite automaton and estimation of the order, Theoret. Comput. Sci. 235 (2000) 183-204.
13. A.N. Trahtman, Piecewise and Local Threshold Testability of DFA, Lecture Notes in Computer Science, Vol. 2138, Springer, Berlin, 2001, pp. 347-358.
14. A.N. Trahtman, A Polynomial Time Algorithm for Left [Right] Local Testability, Lecture Notes in Computer Science, Vol. 2608, Springer, Berlin, 2003, pp. 203-212.
15. E. Vidal, F. Casacuberta, P. Garcia, Grammatical inference and automatic speech recognition, in: Speech Recognition and Coding, Springer, Berlin, 1995, pp. 175-191.
16. Th. Wilke, Locally Threshold Testable Languages of Infinite Words, Lecture Notes in Computer Science, Vol. 665, Springer, Berlin, 1993, pp. 63-79.
17. Th. Wilke, An algebraic theory for regular languages of finite and infinite words, Internat. J. Algebra Comput. 4 (3) (1993) 447-489.