On path equivalence of nondeterministic finite automata

Information Processing Letters

Volumn 58, Issue 1, 1996, Pages 43-46

  Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Automaton; Computational complexity; Path equivalence

Indexed keywords

EID: 0347304865     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00039-7     Document Type: Article

References (10)

1. A. Borodin, S.A. Cook and N. Pippenger, Parallel computation for well-endowed rings and space-bounded probabilistic machines, Inform. and Control 58 (1983) 113-136.
2. S.A. Cook, A taxonomy of problems with fast parallel algorithms. Inform. and Control 64 (1985) 2-22.
3. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation ( Addison-Wesley, Reading, MA, 1979).
4. H.B. Hunt III and R.E. Stearns, On the complexity of equivalence, nonlinear algebra, and optimization on rings, semirings, and lattices (extended abstract). Tech. Rept. TR 86-23, Computer Science Dept., State University of New York at Albany, 1986.
5. N.D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci. 11 (1975) 68-75.
6. Z. Kohavi, Switching and Finite Automata Theory (McGraw-Hill, New York, 1978).
7. R. Milner, Communication and Concurrency (Prentice-Hall, New York, 1989).
8. A. Paz, Introduction to Probabilistic Automata (Academic Press, New York, 1971).
9. R.E. Stearns and H.B. Hunt III, On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata, SIAM J. Comput. 14 (1985) 598-611.
10. W. Tzeng, A polynomial-time algorithm for the equivalence of probabilistic automata, SIAM J. Comput. 21 (1992) 216-227.