Dépliage d'un graphe pointé en un cactus

S. R. Schwer

doi:10.1051/ita/1987210404691

All issues

Volume 21 / No 4 (1987)

RAIRO-Theor. Inf. Appl., 21 4 (1987) 469-477

References

Free Access

Issue		RAIRO-Theor. Inf. Appl. Volume 21, Number 4, 1987


Page(s)		469 - 477
DOI		https://doi.org/10.1051/ita/1987210404691
Published online		01 February 2017

1. J. M. AUTEBERT, Théorie des langages, Masson, Paris, 1987. [Google Scholar]
2. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. [MR: 357173] [Zbl: 0213.25702] [Google Scholar]
3. J. BERSTEL et D. PERRIN, Theory of Codes, Acad. Press., 1985. [MR: 797069] [Zbl: 0587.68066] [Google Scholar]
4. S. RAO KOSARAJU, Analysis of Structured Programs, J.C.S.S., (74), vol. 9, p. 232-285. [MR: 400768] [Zbl: 0293.68014] [Google Scholar]
5. R. MACNAUGHTON et H. YAMADA, Regular Expressions and State Graphs for Automata, Trans IRE EC-9 39-47, 1960. [Zbl: 0156.25501] [Google Scholar]
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. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

[1] 1. J. M. AUTEBERT, Théorie des langages, Masson, Paris, 1987. [Google Scholar]

[2] 2. C. BERGE, Graphes et hypergraphes, Dunod, Paris, 1970. [MR: 357173] [Zbl: 0213.25702] [Google Scholar]

[3] 3. J. BERSTEL et D. PERRIN, Theory of Codes, Acad. Press., 1985. [MR: 797069] [Zbl: 0587.68066] [Google Scholar]

[4] 4. S. RAO KOSARAJU, Analysis of Structured Programs, J.C.S.S., (74), vol. 9, p. 232-285. [MR: 400768] [Zbl: 0293.68014] [Google Scholar]

[5] 5. R. MACNAUGHTON et H. YAMADA, Regular Expressions and State Graphs for Automata, Trans IRE EC-9 39-47, 1960. [Zbl: 0156.25501] [Google Scholar]

[6] 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. [Google Scholar]