Dépliage d'un graphe pointé en un cactus
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1987)
- Volume: 21, Issue: 4, page 469-477
- ISSN: 0988-3754
Access Full Article
top
How to cite
topSchwer, S. R.. "Dépliage d'un graphe pointé en un cactus." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 21.4 (1987): 469-477. <http://eudml.org/doc/92295>.
@article{Schwer1987,
author = {Schwer, S. R.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {labelled graph; cactus},
language = {fre},
number = {4},
pages = {469-477},
publisher = {EDP-Sciences},
title = {Dépliage d'un graphe pointé en un cactus},
url = {http://eudml.org/doc/92295},
volume = {21},
year = {1987},
}
TY - JOUR
AU - Schwer, S. R.
TI - Dépliage d'un graphe pointé en un cactus
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1987
PB - EDP-Sciences
VL - 21
IS - 4
SP - 469
EP - 477
LA - fre
KW - labelled graph; cactus
UR - http://eudml.org/doc/92295
ER -
References
top- 1. J. M. AUTEBERT, Théorie des langages, Masson, Paris, 1987.
- 2. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. Zbl0213.25702MR357173
- 3. J. BERSTEL et D. PERRIN, Theory of Codes, Acad. Press., 1985. Zbl0587.68066MR797069
- 4. S. RAO KOSARAJU, Analysis of Structured Programs, J.C.S.S., (74), vol. 9, p. 232-285. Zbl0293.68014MR400768
- 5. R. MACNAUGHTON et H. YAMADA, Regular Expressions and State Graphs for Automata, Trans IRE EC-9 39-47, 1960. Zbl0156.25501
- 6. S. R. SCHWER, Décidabilité de l'algébricité des langages associés aux Réseaux de Petri, Thèse de 3e cycle de l'Université Paris-VII, 1985.
NotesEmbed ?
topYou 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.