Skip to main content
SpringerLink
Log in

Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 86 (STACS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 210))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

  1. L. Boasson, M. Nivat "Adherences of languages" Journal of computer and System Science 20. pp 285–309

    Google Scholar 

  2. D. Caucal "Décidabilité de l'équivalence forte des R.P.S. monadiques" Rapport LITP. Thèse 3eme cycle Paris 7.

    Google Scholar 

  3. B. Courcelle "A representation of trees by languages" Theoret. Comput. Scie. 6 & 7. pp 255–279 & pp 25–55

    Google Scholar 

  4. B. Courcelle "An axiomatic approach to the KH algorithms" Math. Systems Theory 16. pp 191–231

    Google Scholar 

  5. B. Courcelle "Fundamental properties of infinite trees" Theoret. Comput. Sci. 25. pp 95–169

    Google Scholar 

  6. B. Courcelle. Communication personnelle.

    Google Scholar 

  7. B. Courcelle, J. Vuillemin "Completeness results for the equivalence of recursive schemes" Journal of computer and System Science 12. pp 179–197

    Google Scholar 

  8. E.P. Friedman "Equivalence problems for deterministic context-free languages and monadic recursion schemes" Journal of Computer and System Sciences 14. pp 344–359

    Google Scholar 

  9. S. Garland, D. Luckam "Program Schemes, recursion schemes, and formal languages" Journal of Computer and System Sciences. pp 119–160

    Google Scholar 

  10. S. Ginsburg, S.A. Greibach "Deterministic context-free languages" Information and Control 9. pp 602–648

    Google Scholar 

  11. I. Guessarian "Algebraic semantics" Lecture Note of Computer Science 99.

    Google Scholar 

  12. M.A. Harrisson "Introduction to formal language theory" Addison-Wesley

    Google Scholar 

  13. M.A. Harrison, I.M. Havel, A. Yeduhaï "On equivalence of grammars through transformation trees" Theoret. Comput. Sci. 9. pp 191–231

    Google Scholar 

  14. G. Huet "Confluent reductions: abstract properties and applications to term rewriting systems" Journal of the Assoc. for Comput. Mach. 17. pp 797–821

    Google Scholar 

  15. A.J. Korenjak, J.E. Hopcroft "Simple deterministic languages" Seventh Annual IEEE Switching and Automata Theory Conference. pp 36–46

    Google Scholar 

  16. 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. M. Nivat "On the interpretation of polyadic recursive schemes" Symposia Mathematica 15, Academic Press

    Google Scholar 

  18. M. Nivat "Mots infinis engendrés par une grammaire algébrique" Rairo 11. pp 311–327

    Google Scholar 

  19. M. Nivat "Sur les ensembles de mots infinis engendrés par une grammaire algébrique" Rairo 12. pp 259–278

    Google Scholar 

  20. T. Olshansky, A. Pnueli "A direct algorithm for checking equivalence of LL(k) grammars" Theoret. Comput. Sci. 4. pp 321–349

    Google Scholar 

  21. E. Tomita "An extended direct branching algorithm for checking equivalence of deterministic pushdown automata" Theoret. Comput. Sci. 32. pp 87–120

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA. Campus de Beaulieu, 35042, Rennes, France

    D. Caucal

Authors
  1. D. Caucal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien G. Vidal-Naquet

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caucal, D. (1985). Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-16078-7_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16078-6

  • Online ISBN: 978-3-540-39758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation