no. 4
Graphes canoniques de graphes algébriques
RAIRO. Informatique théorique et applications, Tome 24 (1990) no. 4, pp. 339-352 
@article{ITA_1990__24_4_339_0,
     author = {Caucal, Didier},
     title = {Graphes canoniques de graphes alg\'ebriques},
     journal = {RAIRO. Informatique th\'eorique et applications},
     pages = {339--352},
     year = {1990},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {4},
     mrnumber = {1079719},
     zbl = {0701.68082},
     language = {fr},
     url = {https://www.numdam.org/item/ITA_1990__24_4_339_0/}
}
TY  - JOUR
AU  - Caucal, Didier
TI  - Graphes canoniques de graphes algébriques
JO  - RAIRO. Informatique théorique et applications
PY  - 1990
SP  - 339
EP  - 352
VL  - 24
IS  - 4
PB  - EDP-Sciences
UR  - https://www.numdam.org/item/ITA_1990__24_4_339_0/
LA  - fr
ID  - ITA_1990__24_4_339_0
ER  - 
%0 Journal Article
%A Caucal, Didier
%T Graphes canoniques de graphes algébriques
%J RAIRO. Informatique théorique et applications
%D 1990
%P 339-352
%V 24
%N 4
%I EDP-Sciences
%U https://www.numdam.org/item/ITA_1990__24_4_339_0/
%G fr
%F ITA_1990__24_4_339_0
Caucal, Didier. Graphes canoniques de graphes algébriques. RAIRO. Informatique théorique et applications, Tome 24 (1990) no. 4, pp. 339-352. https://www.numdam.org/item/ITA_1990__24_4_339_0/

[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. | Zbl | MR

[2] D. Caucal, Décidabilité de l'égalité des langages algébriques infinitaires simples, LNCS 210, 1986, p. 37-48. | Zbl | MR

[3] D. Caucal, On the regular structure of prefix rewritings, Rapport interne 507, CAAP90 paraîtra dans LNCS, 1990. | Zbl | MR

[4] P. M. Cohn, Universal Algebra, Klumer Academic Publishers Group, 1981. | MR | Zbl

[5] B. Courcelle, An Axiomatic Approach to the KH Algorithms, Math. Systems Theory, vol. 16, 1983, p. 191-231. | Zbl | MR

[6] I. Guessarian, Algebraic Semantics, LNCS 99, 1981. | Zbl | MR

[7] D. Muller et P. Schupp, The Theory of Ends, Pushdown Automata, and Second Order Logic, TCS 37, 1985, p. 51-75. | Zbl | MR

[8] D. Park, Concurrency and Automata on Infinite Sequences, LNCS 104, 1981, p. 167-183. | Zbl