T(A) = T(B)?

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

Volumn 1644 LNCS, Issue , 1999, Pages 665-675

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Complete formal systems; Deterministic pushdown transducers; Finite dimensional vector spaces; Matrix semi groups; Rational series; Test sets

Indexed keywords

EQUIVALENCE CLASSES; VECTOR SPACES;

COMPLETE FORMAL SYSTEMS; FINITE DIMENSIONAL VECTOR SPACES; PUSHDOWN; RATIONAL SERIES; SEMI-GROUP; TEST SETS;

AUTOMATA THEORY;

EID: 22644451974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_63     Document Type: Conference Paper

References (17)

1. [BR88] J. Berstel and C. Reutenauer. Rational Series and their Languages. Springer, 1988.
2. [Buc85] B. Buchberger. Basic features and development of the criticalpair/completion algorithm. In Proceedings 1st RTA, pages 1{45. LNCS 202, 1985.
3. [CK86a] K. CulikII and J. Karhum̈aki. The equivalence of finite-valued transducers (on HDT0L languages) is decidable. Theoretical Computer Science, pages 71{84, 1986.
4. [CK86b] K. CulikII and J. Karhum̈aki. Synchronizable deterministic pushdown automata and the decidability of their equivalence. Acta Informatica 23, pages 597{605, 1986.
5. [Cou83] B. Courcelle. An axiomatic approach to the Korenjac-Hopcroft algorithms. Math. Systems theory, pages 191{231, 1983.
6. [Cul90] K. CulikII. New techniques for proving the decidability of equivalence problems. Theoretical Computer Science, pages 29{45, 1990.
7. [Gub85] V.S. Guba. A solution of Ehrenfeucht's conjecture. unpublished note, 1985.
8. [IR81] O.H. Ibarra and L. Rosier. On the decidability of equivalence problem for deterministic pushdown transducers. Information Processing Letters 13, pages 89{93, 1981.
9. [Lis96] L.P. Lisovik. Hard sets methods and semilinear reservoir method with applications. In Proceedings 23rd ICALP, pages 229{231. Springer, LNCS 1099, 1996.
10. [LS77] R.C. Lyndon and P.E. Schupp. Combinatorial Group Theory. Springer Verlag, 1977.
11. [Mei89] Y.V. Meitus. The equivalence problem for real-time strict deterministic pushdown automata. Kibernetika 5 ( in russian, english translation in Cybernetics and Systems analysis), pages 14{25, 1989.
12. [RS80] G. Rozenberg and A. Salomaa. The Mathematical Theory of L-systems. Academic Press, New-York, 1980.
13. [Sen97] G. Senizergues. L(A) = L(B)? In Proceedings INFINITY 97, pages 1{26. Electronic Notes in Theoretical Computer Science 9, URL: http://www.elsevier.nl/locate/entcs/volume9.html, 1997.
14. [Sen98a] G. Senizergues. The equivalence problem for deterministic pushdown transducers into abelian groups. In Proceedings MFCS'98, pages 305{315. Springer, LNCS 1450, 1998.
15. [Sen98b] G. Senizergues. L(A) = L(B)? Technical report, LaBRI, Universitte Bordeaux I, 1998. Improved version of report 1161-97, submitted to TCS, accessible at URL, http://www.labri.u-bordeaux.fr/ges, pages 1-166, april 1998.
16. [S-en99] G. Senizergues. T(A) = T(B)? Technical report, nr 1209-99, LaBRI, 1999. Pages 1-61. Can be accessed at URL, http://www.labri.u-bordeaux.fr/ ges.
17. [TS89] E. Tomita and K. Seino. A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is realtime strict. Theoretical Computer Science, pages 39{53, 1989.