论文信息 - On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs

On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs

We explore the boundaries between decidability and undecidability of the containment and equivalence problems for restricted classes of nondeterministic generalized sequential machines (NGSMs), nondeterministic finite transducers (NFTs), nondeterministic pushdown transducers (NPDTs), and linear context-free grammars (LCFGs). We believe that our results are the sharpest known to date concerning these devices.

Oscar H. Ibarra

[1] 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..

[2] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[3] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[4] Andreas Weber,et al. Decomposing Finite-Valued Transducers and Deciding Their Equivalence , 1993, SIAM J. Comput..

[5] Eitan M. Gurari,et al. A note on finite-valued and finitely ambiguous transducers , 1983, Mathematical systems theory.

[6] Andreas Weber,et al. On the valuedness of finite transducers , 1990, Acta Informatica.

[7] 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).

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

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

[10] Karel Culik,et al. The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable , 1986, MFCS.