A polynomial-time algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by accept mode

IEICE Transactions on Information and Systems

Volumn E81-D, Issue 1, 1998, Pages 1-11

  Higuchi, Ken ^a   Wakatsuki, Mitsuo ^b   Tomita, Etsuji ^a  

^a UNIVERSITY OF FUKUI   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Decision algorithm; Deterministic pushdown automaton; Deterministic restricted one counter automaton; Inclusion problem; Language theory

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; FORMAL LANGUAGES; POLYNOMIALS; REAL TIME SYSTEMS;

DETERMINISTIC ONE COUNTER AUTOMATON (DOCA); DETERMINISTIC PUSHDOWN AUTOMATON (DPDA); DETERMINISTIC RESTRICTED ONE COUNTER AUTOMATON (DROCA);

AUTOMATA THEORY;

EID: 0031699254     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. J. Berstel, Transductions and Context-Free Languages, Teubner Studienbücher, Stuttgart, 1979.
2. E.P. Friedman, The inclusion problem for simple languages, Theoret. Comput. Sci., vol.1, no.4, pp.297-316, 1976.
3. E.P. Friedman and S.A. Greibach, Superdeterministic DP-DAs: The method of accepting does affect decision problems, J. Comput. & Syst. Sci., vol.19, no.l, pp.79-117, 1979.
4. S.A. Greibach and E.P. Friedman, Superdeterministic PDAs: A subcase with a decidable inclusion problem, J. Assoc. Comput. Mach., vol.27, no.4, pp.675-700, 1980.
5. K. Higuchi, E. Tomita, and M. Wakatsuki, A polynomialtime algorithm for checking the inclusion for strict deterministic restricted one-counter automata, IEICE Trans. Inf. & Syst., vol.E78-D, no.4, pp.305-313, 1995.
6. K. Higuchi, M. Wakatsuki, and E. Tomita, A polynomialtime algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by final state, IEICE Trans. Inf. & Syst., vol.E78-D, no.8, pp.939-950, 1995.
7. K. Higuchi, M. Wakatsuki, and E. Tomita, A polynomialtime algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by accept mode, IEICE Technical Report, COMP95-97, 1996.
8. K. Higuchi, M. Wakatsuki, and E. Tomita, A polynomialtime algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by accept mode, Tech. Rep. UEC-CAS96-1, Dept. of Communications and Systems Engineering, The Univ. of Electro-Commun., 1996.
9. K. Higuchi, M. Wakatsuki, and E. Tomita, Some properties of deterministic restricted one-counter automata, IEICE Trans. Inf. & Syst., vol.E79-D, no.7, pp.914-924, 1996.
10. L.G. Valiant, Decision procedures for families of deterministic pushdown automata, Ph.D. Thesis, Univ. of Warwick, 1973.
11. L.G. Valiant and M.S. Paterson, Deterministic one-counter automata, J. Comput. & Syst. Sci., vol.10, no.3, pp.340-350, 1975.