The equivalence problem for deterministic pushdown transducers into abelian groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 305-315

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; TRANSDUCERS; ALGEBRA;

ABELIAN GROUP; COMPLETE FORMAL SYSTEMS; EQUIVALENCE PROBLEM; FREE MONOIDS; PUSHDOWN; RATIONAL SERIES;

GROUP THEORY;

EID: 84896742896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055780     Document Type: Conference Paper

References (18)

1. J. Berstel and C. Reutenauer. Rational Series and their Languages. Springer, 1988.
2. A.P. Biryukov. Some algorithmic problems for finitely defined commutative semigroups. Siberian Math. Journal 8, pages 384-391, 1967.
3. C. Choffrut. A generalization of Ginsburg and Rose's characterisation of gsm mappings. In Proceedings ICALP 79, pages 88-103. LNCS, Springer-Verlag, 1979.
4. B. Courcelle. An axiomatic approach to the Korenjac-Hopcroft algorithms. Math. Systems theory, pages 191-231, 1983.
5. R.H. Gilman. Presentations of groups and monoids. Journal of Algebra 57, pages 544-554, 1979.
6. T. Harju and J. Karhumäki. The equivalence problem of multitape finite automata. TCS 78, pages 347-355, 1991.
7. M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173-205, 1979.
8. O. Ibarra. The unsolvability of the equivalence problem for e-free ngsm's with unary input (output) alphabet and applications. In Proceedings FOCS 78, pages 74-81. IEEE, 1978.
9. O.H. Ibarra and L. Rosier. On the decidability of equivalence problem for deterministic pushdown transducers. Information Processing Letters 13, pages 89-93, 1981.
10. K. Kulik II and J. Karhumäki. Synchronizable deterministic pushdown automata and the decidability of their equivalence. Acta Informatica 23, pages 597-605, 1986.
11. W. Kuich and D. Raz. On the multiplicity equivalence problem for context-free grammars. In Important Results and trends in Theoretical Computer Science (Colloquium in Honor of Aarto Salomaa), pages 232-250. Springer-Verlag, LNCS 812, 1994.
12. Y.V. Meitus. The equivalence problem for real-time strict deterministic pushdown automata. Cybernetics and Systems analysis, pages 581-594, 1990
13. Original article (in russian) in Kibernetika 5, p. 14-25, 1989.
14. G. Sénizergues. L(A) = L(B)? In Proceedings INFINITY 97, pages 1-26
15. Electronic Notes in Theoretical Computer Science 9, URL: http://www.elsevier.nl/locate/entcs/volume9.html, 1997.
16. G. Sénizergues. L(A) = L(B)? Technical report, corrected and extended version of nr 1161-97, LaBRI, Université Bordeaux I, can be accessed at URL:http://www.labri.u-bordeaux.fr/~ges, 1998.
17. M. Taiclin. Algorithmic problems for commutative semigroups. Soviet Math. Dokl., pages 201-204, 1968.
18. E. Tomita and K. Seino. A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict. Theoretical Computer science, pages 39-53, 1989.