Intractability of decision problems for finite-memory automata

Theoretical Computer Science

Volumn 231, Issue 2, 2000, Pages 297-308

  Sakamoto, Hiroshi ^a   Ikeda, Daisuke ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

Complexity; Decision problems; Finite memory automata; Formal languages

Indexed keywords

EID: 0042465982     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00105-X     Document Type: Article

References (4)

1. L.M. Goldschlager, The monotone and planar circuit value problems are log space complete for P, SIGACT News 9 (1977) 25-29.
2. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, Reading, MA, 1979.
3. M. Kaminski, N. Francez, Finite-memory automata, Theoret. Comput. Sci. 134 (1994) 329-363.
4. C.H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Reading, MA, 1994.