@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},
pages = {7--22},
year = {1993},
publisher = {EDP Sciences},
volume = {27},
number = {1},
mrnumber = {1213418},
zbl = {0787.68060},
language = {en},
url = {https://www.numdam.org/item/ITA_1993__27_1_7_0/}
}
TY - JOUR AU - Ehrenfeucht, A. AU - Hoogeboom, H. J. AU - Rozenberg, G. TI - On the structure of recognizable languages of dependence graphs JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1993 SP - 7 EP - 22 VL - 27 IS - 1 PB - EDP Sciences UR - https://www.numdam.org/item/ITA_1993__27_1_7_0/ LA - en ID - ITA_1993__27_1_7_0 ER -
%0 Journal Article %A Ehrenfeucht, A. %A Hoogeboom, H. J. %A Rozenberg, G. %T On the structure of recognizable languages of dependence graphs %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1993 %P 7-22 %V 27 %N 1 %I EDP Sciences %U https://www.numdam.org/item/ITA_1993__27_1_7_0/ %G en %F 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) no. 1, pp. 7-22. https://www.numdam.org/item/ITA_1993__27_1_7_0/
[AR1] and , Theory of Traces, Theoretical Computer Science, Vol. 60 1988, pp. 1-82. | Zbl | MR
[AR2] and , Traces, Dependency Graphs and DNLC Grammars, Discrete Applied Mathematics, Vol. 11 1985, pp. 299-306. | Zbl | MR
[AW] and , Trace Languages Defined by Regular String Languages, RAIRO Informatique Théorique, Vol. 20 1986, pp. 103-119 | Zbl | MR | Numdam
[BMS] , and , Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71. | Zbl | MR
[CF] and , Problèmes combinatoires de commutation et rearrangements, Lecture Notes in Mathematics, Vol. 85, 1981.
[CP] and , Automates et commutations partielles, RAIRO Informatique Théorique, Vol. 19, 1985, pp. 21-32 | Zbl | MR | Numdam
[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. | Zbl | MR
[ER] and , On the structure of dependency graphs, in: Concurrency and nets, K. Voss, H. J. GENRICH, G. ROZENBERG Eds., Springer Verlag, 1987, pp. 141-170. | Zbl | MR
[FR] and , On Serizlizability of Iterated Transactions, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, 1982, pp. 194-200.
[K] , A Solvable Program-Schema Equivalence Problem, Proc. 5th Annual Princeton Conference on Information Sciences and Systems, Princeton, 1971, pp. 301-306.
[Ml] , Concurrent Program Schemes and their Interpretations, Dept. of Computer Science, University of Aarhus, Technical Report No. PB-78, Aarhus, 1977.
[M2] , Semantics of Concurrent Systems: a Modular Fixed Point Approach, Lecture Notes in Computer Science, Vol. 188, 1985, pp. 353-375. | Zbl | MR
[Me] , Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, RAIRO Informatique Théorique, Vol. 20, 1986, pp. 121-127. | Zbl | MR | Numdam
[O] , Regular Trace Languages, Ph.D. Thesis, Dept. of Mathematics, University of Warsaw, 1985.
[P] , Partial Commutations, Lecture Notes in Computer Science, Vol. 372, pp. 637-651. | MR
[RW] and , Boundary NLC grammars. Basic Definitions, Normal Forms and Complexity, Information and Control, Vol. 69, 1986, pp. 136-167. | Zbl | MR






