Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples

  • D. Caucal
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

  1. Bo-Ni 80.
    L. Boasson, M. Nivat "Adherences of languages" Journal of computer and System Science 20. pp 285–309Google Scholar
  2. Ca 85.
    D. Caucal "Décidabilité de l'équivalence forte des R.P.S. monadiques" Rapport LITP. Thèse 3eme cycle Paris 7.Google Scholar
  3. Co 78.
    B. Courcelle "A representation of trees by languages" Theoret. Comput. Scie. 6 & 7. pp 255–279 & pp 25–55Google Scholar
  4. Co 83a.
    B. Courcelle "An axiomatic approach to the KH algorithms" Math. Systems Theory 16. pp 191–231Google Scholar
  5. Co 83b.
    B. Courcelle "Fundamental properties of infinite trees" Theoret. Comput. Sci. 25. pp 95–169Google Scholar
  6. Co 84.
    B. Courcelle. Communication personnelle.Google Scholar
  7. Co-Vu 76.
    B. Courcelle, J. Vuillemin "Completeness results for the equivalence of recursive schemes" Journal of computer and System Science 12. pp 179–197Google Scholar
  8. Fr 77.
    E.P. Friedman "Equivalence problems for deterministic context-free languages and monadic recursion schemes" Journal of Computer and System Sciences 14. pp 344–359Google Scholar
  9. Ga-Lu 73.
    S. Garland, D. Luckam "Program Schemes, recursion schemes, and formal languages" Journal of Computer and System Sciences. pp 119–160Google Scholar
  10. Gi-Gr 66.
    S. Ginsburg, S.A. Greibach "Deterministic context-free languages" Information and Control 9. pp 602–648Google Scholar
  11. Gu 81.
    I. Guessarian "Algebraic semantics" Lecture Note of Computer Science 99.Google Scholar
  12. Ha 78.
    M.A. Harrisson "Introduction to formal language theory" Addison-Wesley Google Scholar
  13. Ha-Ha Ye 79.
    M.A. Harrison, I.M. Havel, A. Yeduhaï "On equivalence of grammars through transformation trees" Theoret. Comput. Sci. 9. pp 191–231Google Scholar
  14. Hu 80.
    G. Huet "Confluent reductions: abstract properties and applications to term rewriting systems" Journal of the Assoc. for Comput. Mach. 17. pp 797–821Google Scholar
  15. Ko-Ho 66.
    A.J. Korenjak, J.E. Hopcroft "Simple deterministic languages" Seventh Annual IEEE Switching and Automata Theory Conference. pp 36–46Google Scholar
  16. Ni 72.
    M. Nivat "Langages algébriques sur le magma libre et sémantique des schémas de programmes" Proc. I.C.A.L.P. 1. North-Holland, Amsterdam.Google Scholar
  17. Ni 75.
    M. Nivat "On the interpretation of polyadic recursive schemes" Symposia Mathematica 15, Academic PressGoogle Scholar
  18. Ni 77.
    M. Nivat "Mots infinis engendrés par une grammaire algébrique" Rairo 11. pp 311–327Google Scholar
  19. Ni 78.
    M. Nivat "Sur les ensembles de mots infinis engendrés par une grammaire algébrique" Rairo 12. pp 259–278Google Scholar
  20. Ol-Pn 77.
    T. Olshansky, A. Pnueli "A direct algorithm for checking equivalence of LL(k) grammars" Theoret. Comput. Sci. 4. pp 321–349Google Scholar
  21. To 84.
    E. Tomita "An extended direct branching algorithm for checking equivalence of deterministic pushdown automata" Theoret. Comput. Sci. 32. pp 87–120Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • D. Caucal
    • 1
  1. 1.IRISA. Campus de BeaulieuRennesFrance

Personalised recommendations