On the structure of recognizable languages of dependence graphs
Ehrenfeucht, A. ; Hoogeboom, H. J. ; Rozenberg, G.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993), p. 7-22 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1993-01-01
@article{ITA_1993__27_1_7_0,
     author = {Ehrenfeucht, A. and Hoogeboom, H. J. and Rozenberg, G.},
     title = {On the structure of recognizable languages of dependence graphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {27},
     year = {1993},
     pages = {7-22},
     mrnumber = {1213418},
     zbl = {0787.68060},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1993__27_1_7_0}
}

Ehrenfeucht, A.; Hoogeboom, H. J.; Rozenberg, G. On the structure of recognizable languages of dependence graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) pp. 7-22. http://gdmltest.u-ga.fr/item/ITA_1993__27_1_7_0/

[AR1] Ij. J. Aalbersberg and G. Rozenberg, Theory of Traces, Theoretical Computer Science, Vol. 60 1988, pp. 1-82. | MR 947532 | Zbl 0652.68017

[AR2] Ij. J. Aalbersberg and G. Rozenberg, Traces, Dependency Graphs and DNLC Grammars, Discrete Applied Mathematics, Vol. 11 1985, pp. 299-306. | MR 792896 | Zbl 0601.68045

[AW] Ij. J. Aalbersberg and E. Welzl, Trace Languages Defined by Regular String Languages, RAIRO Informatique Théorique, Vol. 20 1986, pp. 103-119 | Numdam | MR 860763 | Zbl 0612.68071

[BMS] A. Berton, G. Mauri and N. Sabadin, Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71. | MR 675445 | Zbl 0486.68079

[CF] P. Cartier and D. Foata, Problèmes combinatoires de commutation et rearrangements, Lecture Notes in Mathematics, Vol. 85, 1981.

[CP] R. Cori and D. Perrin, Automates et commutations partielles, RAIRO Informatique Théorique, Vol. 19, 1985, pp. 21-32 | Numdam | MR 795769 | Zbl 0601.68055

[ENR] H. EHRIG, M. NAGL and G. ROZENBERG eds. Graph Grammars and their Applications to Computer Science, Lecture Notes in Computer Science, Vol. 153 1983. | MR 707856 | Zbl 0512.00027

[ER] A. Ehrenfeucht and G. Rozenberg, On the structure of dependency graphs, in: Concurrency and nets, K. Voss, H. J. GENRICH, G. ROZENBERG Eds., Springer Verlag, 1987, pp. 141-170. | MR 911917 | Zbl 0642.68031

[FR] M. P. Flé and G. Roucairol, On Serizlizability of Iterated Transactions, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, 1982, pp. 194-200.

[K] R. M. Keller, A Solvable Program-Schema Equivalence Problem, Proc. 5th Annual Princeton Conference on Information Sciences and Systems, Princeton, 1971, pp. 301-306.

[Ml] A. Mazurkiewicz, Concurrent Program Schemes and their Interpretations, Dept. of Computer Science, University of Aarhus, Technical Report No. PB-78, Aarhus, 1977.

[M2] A. Mazurkiewicz, Semantics of Concurrent Systems: a Modular Fixed Point Approach, Lecture Notes in Computer Science, Vol. 188, 1985, pp. 353-375. | MR 807209 | Zbl 0576.68044

[Me] Y. Metivier, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, RAIRO Informatique Théorique, Vol. 20, 1986, pp. 121-127. | Numdam | MR 860764 | Zbl 0599.20107

[O] E. Ochmanski, Regular Trace Languages, Ph.D. Thesis, Dept. of Mathematics, University of Warsaw, 1985.

[P] D. Perrin, Partial Commutations, Lecture Notes in Computer Science, Vol. 372, pp. 637-651. | MR 1037081

[RW] G. Rozenberg and E. Welzl, Boundary NLC grammars. Basic Definitions, Normal Forms and Complexity, Information and Control, Vol. 69, 1986, pp. 136-167. | MR 848438 | Zbl 0608.68060