Some Decision Problems Concerning Sequential Transducers and Checking Automata

Abstract Boundary points between decidability and undecidability of various decision questions concerning two-way sequential transducers and checking automata are investigated. The results show how some unsolvable problems become solvable when certain restrictions (e.g., the machines being deterministic, reversal-bounded, etc.) are imposed. A solution to an open problem concerning cascade products of pushdown automata is also given.

[1]  Seymour Ginsburg,et al.  One-way stack automata , 1967, JACM.

[2]  Leslie G. Valiant,et al.  Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..

[3]  Oscar H. Ibarra.  On Two-Way Sequential Transductions of Full Semi-AFL's , 1978, Theor. Comput. Sci..

[4]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[5]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[6]  Tadashi Ae.  Direct or Cascade Product of Pushdown Automata , 1977, J. Comput. Syst. Sci..

[7]  Oscar H. Ibarra.  The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications , 1978, SIAM J. Comput..

[8]  Timothy V. Griffiths.  The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.

[9]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[10]  S. Ginsburg,et al.  Bounded -like languages , 1964 .

[11]  Václav Rajlich.  Absolutely Parallel Grammars and Two-Way Finite State Transducers , 1972, J. Comput. Syst. Sci..

[12]  Sheila A. Greibach,et al.  One Way Finite Visit Automata , 1978, Theor. Comput. Sci..

[13]  Oscar H. Ibarra,et al.  The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  Stephen S. Yau,et al.  Two-Way Sequential Transductions and Stack Automata , 1971, Inf. Control..

[15]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[16]  Sheila A. Greibach,et al.  Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[17]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .