Complete formal systems for equivalence problems

Theoretical Computer Science

Volumn 231, Issue 2, 2000, Pages 309-334

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Bisimulation; Complete formal systems; Deterministic pushdown automata; Deterministic pushdown transducers; Equivalence problems

Indexed keywords

EID: 0346929351     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00106-1     Document Type: Article

References (32)

1. J.M. Autebert, L. Boasson, J. Berstel, Context-free languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1996.
2. J. Baeten, J. Bergstra, J. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, in Proceedings of PARLE 87, Lecture Notes in Computer Science, vol. 259, Springer, Berlin, 1987, pp. 94-111.
3. J. Berstel, C. Reutenauer, Rational Series and their Languages, Springer, Berlin, 1988.
4. D. Caucal, A fast algorithm to decide on the equivalence of stateless dpda, RAIRO Theoret. Inform. Appl. 27 (1) (1993) 23-48.
5. D. Caucal, Bisimulation of context-free grammars and of pushdown automata, in: Modal Logic and Process Algebra, CSLI Lectures Notes, vol. 53, 1995, pp. 85-106.
6. B. Courcelle, Une forme canonique pour les grammaires simples déterministes, RAIRO informatique (1974) 19-36.
7. B. Courcelle, An axiomatic approach to the Korenjac-Hopcroft algorithms, Math. Systems theory (1983) 191-231.
8. J. Engelfriet, Iterated pushdown automata and complexity classes, in: Proc. 15th STOC, 1983, pp. 365-373.
9. J. Engelfriet, H. Vogler, Pushdown machines for the macro tree transducer, Theoret. Comput. Sci. 42 (1986) 251-368.
10. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
11. M.A. Harrison, I.M. Havel, A. Yehudai, On equivalence of grammars through transformation trees, Theoret. Comput. Sci. 9 (1979) 173-205.
12. Y. Hirshfeld, M. Jerrum, F. Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes, in Proceedings of Dagstuhl seminar on Algorithms in Automata theory, Theoret. Comput. Sci., 1996, to appear.
13. J.E. Hopcroft, A.J. Korenjac, Simple deterministic languages, in: Proceedings Seventh Annual IEEE Switching and Automata Theory Conference, 1966, pp. 36-46.
14. P. Jancar, Bisimulation is decidable for one-counter processes, in: Proceedings ICALP 97, Springer, Berlin, 1997, pp. 549-559.
15. W. Kuich, Semirings and formal power series: Their relevance to formal languages and automata, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Forma Languages, Springer, Berlin, 1996, pp. 609-677.
16. A.N. Maslov, Multilevel stack automata, Problemi Peredachi Informatsii, 1976, pp. 55-62.
17. Y.V. Meitus, The equivalence problem for real-time strict deterministic pushdown automata, Kibernetika 5 (in Russian) (1989) 14-25, English translation in Cybernet. Systems Anal. (1990) 581-594.
18. Y.V. Meitus, The equivalence problem for real-time strict deterministic pushdown automata, Kibernetika 5 (in Russian) (1989) 14-25, English translation in Cybernet. Systems Anal. (1990) 581-594.
19. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood cliffs, NJ, 1989.
20. D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167-183.
21. G. Sénizergues, Γ(A) ∼ Γ(B)?, Technical Report, nr 1183-97, LaBRI, Université Bordeaux I, can be accessed at URL, http://www.labri.u-bordeaux.fr/~ges/, 1997, pp. 1-112.
22. G. Sénizergues, L(A) = L(B)?, Technical Report, nr1161-97, LaBRI, Université Bordeaux I, can be accessed at URL, http://www.labri.u-bordeaux.fr/, 1997, pp. 1-71.
23. G. Sénizergues,L(A) = L(B)?, in: Proc. INFINITY 97, pp. 1-26, Electronic Notes in Theoretical Computer Science 9, URL: http://www.elsevier.nl/locate/entcs/voL9.html, 1997.
24. G. Sénizergues, The equivalence problem for deterministic pushdown automata is decidable, in: Proc. ICALP 97, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 671-681.
25. G. Sénizergues, Decidability of bisimulation equivalence for equational graphs of finite out-degree, in: Rajeev Motwani (ed.), Proceedings FOCS'98, pp. 120-129. IEEE Computer Society Press, 1998. Full proofs in technical report 1183-97 of LaBRI, Γ(A) ∼ Γ(B)?, pp. 1-113.
26. G. Sénizergues, L(A) = L(B)?, Technical Report, LaBRI, Université Bordeaux I, 1998, Corrected and extended version of report 1161-97; can be accessed at URL, http://www.labri.u-bordeaux.fr/~ges/; pp. 1-166; Theoret. Comput. Sci., submitted for publication.
27. G. Sénizergues, L(A) = L(B)?, Technical Report, LaBRI, Université Bordeaux I, 1998, Corrected and extended version of report 1161-97; can be accessed at URL, http://www.labri.u-bordeaux.fr/~ges/; pp. 1-166; Theoret. Comput. Sci., submitted for publication.
28. G. Sénizergues, The equivalence problem for deterministic pushdown transducers into abelian groups, in: L. Brim, J. Gruska, and J. Zlatuska (eds.), Proceedings MFCS'98, volume 1450, pp. 305-315. Lecture Notes in Computer Science, 1998.
29. C. Stirling, Decidability of bisimulation equivalence for normed pushdown processes, in: Proc. CONCUR 96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 217-232
30. L.G. Valiant, Decision procedures for families of deterministic pushdown automata, Ph. D. Thesis, University of Warwick, 1973.
31. H. Vogler, Iterated linear control and iterated one-turn pushdowns, Math. Systems Theory 19 (1986) 117-133.
32. D.J. Weir, Linear iterated pushdowns, Comput. Intell. 10 (4) (1994) 431-439.