Graphes canoniques de graphes algébriques

Didier Caucal

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1990)

  • Volume: 24, Issue: 4, page 339-352
  • ISSN: 0988-3754

How to cite

top

Caucal, Didier. "Graphes canoniques de graphes algébriques." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 24.4 (1990): 339-352. <http://eudml.org/doc/92362>.

@article{Caucal1990,
author = {Caucal, Didier},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {grammars; bisimulation; canonical graph},
language = {fre},
number = {4},
pages = {339-352},
publisher = {EDP-Sciences},
title = {Graphes canoniques de graphes algébriques},
url = {http://eudml.org/doc/92362},
volume = {24},
year = {1990},
}

TY - JOUR
AU - Caucal, Didier
TI - Graphes canoniques de graphes algébriques
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1990
PB - EDP-Sciences
VL - 24
IS - 4
SP - 339
EP - 352
LA - fre
KW - grammars; bisimulation; canonical graph
UR - http://eudml.org/doc/92362
ER -

References

top
  1. [1] J. C. M. BAETEN, J. A. BERGSTRA et J. W. KLOP, Decidability of Bisimulation Equivalence for Processes Generating Context-free Languages, LNCS 259, 1987, p. 94-111. Zbl0635.68014MR910305
  2. [2] D. CAUCAL, Décidabilité de l'égalité des langages algébriques infinitaires simples, LNCS 210, 1986, p. 37-48. Zbl0595.68072MR827723
  3. [3] D. CAUCAL, On the regular structure of prefix rewritings, Rapport interne 507, CAAP90 paraîtra dans LNCS, 1990. Zbl0786.68047MR1075024
  4. [4] P. M. COHN, Universal Algebra, Klumer Academic Publishers Group, 1981. MR620952
  5. [5] B. COURCELLE, An Axiomatic Approach to the KH Algorithms, Math. Systems Theory, vol. 16, 1983, p. 191-231. Zbl0581.68032MR702448
  6. [6] I. GUESSARIAN, Algebraic Semantics, LNCS 99, 1981. Zbl0474.68010MR617908
  7. [7] D. MULLER et P. SCHUPP, The Theory of Ends, Pushdown Automata, and Second Order Logic, TCS 37, 1985, p. 51-75. Zbl0605.03005MR796313
  8. [8] D. PARK, Concurrency and Automata on Infinite Sequences, LNCS 104, 1981, p. 167-183. Zbl0457.68049

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.