Trace languages defined by regular string languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 20 (1986) no. 2, pp. 103-119.
@article{ITA_1986__20_2_103_0,
     author = {Aalbersberg, Ijsbrand Jan and Welzl, Emo},
     title = {Trace languages defined by regular string languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {103--119},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {2},
     year = {1986},
     zbl = {0612.68071},
     mrnumber = {860763},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1986__20_2_103_0/}
}
TY  - JOUR
AU  - Aalbersberg, Ijsbrand Jan
AU  - Welzl, Emo
TI  - Trace languages defined by regular string languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1986
DA  - 1986///
SP  - 103
EP  - 119
VL  - 20
IS  - 2
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - http://www.numdam.org/item/ITA_1986__20_2_103_0/
UR  - https://zbmath.org/?q=an%3A0612.68071
UR  - https://www.ams.org/mathscinet-getitem?mr=860763
LA  - en
ID  - ITA_1986__20_2_103_0
ER  - 
%0 Journal Article
%A Aalbersberg, Ijsbrand Jan
%A Welzl, Emo
%T Trace languages defined by regular string languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1986
%P 103-119
%V 20
%N 2
%I AFCET - Gauthier-Villars
%C Paris
%G en
%F ITA_1986__20_2_103_0
Aalbersberg, Ijsbrand Jan; Welzl, Emo. Trace languages defined by regular string languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 20 (1986) no. 2, pp. 103-119. http://www.numdam.org/item/ITA_1986__20_2_103_0/

1. Ij.J. Aalbersberg and G. Rozenberg, Traces - a Survey, Techn. Rep. 85-16, Inst. of Appl. Math. and Comput. Sc., Univ. of Leiden, Leiden, 1985.

2. Ij. J. Aalbersberg and G. Rozenberg, Traces, Dependency Graphs and DNLC Grammars, Discrete Appl. Math, Vol. 11, 1985, pp.299-306. | MR | Zbl

3. A. Bertoni, M. Brambilla, G. Mauri and N. Sabadini, An Application of the Theory of Free Partially Commutative Monoids : Asymptotic Densities of Trace Languages, Lecture Notes in Computer Science, Vol. 118, 1981, pp. 205-215. | Zbl

4. A. Bertoni, G. Mauri and N. Sabadini, A Hierarchy of Regular Trace Languages and Sorne Combinatorial Applications, Proc. 2nd.World Conf. on Math, at the Service of Men, Las Palmas, 1982, pp.146-153. | Zbl

5. A. Bertoni, G. Mauri and N. Sabadini, Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71. | MR | Zbl

6. A. Bertoni, G. Mauri and N. Sabadini, Unambiguous Regular Trace Languages, to appear in Algebra, Combinatorics and Logic in Comput. Sc. (to appear), Colloquia Math. Soc. J. Bolay. | MR | Zbl

7. R. Cori and D. Perrin, Automates et Commutations Partielles, R.A.I.R.O., Inform. Théor., Vol. 19, 1985, pp. 21-32. | Numdam | MR | Zbl

8. M. Fleiss, Matrices de Hankel, J. Math. Pures Appl., Vol. 53, 1974, pp. 197-222. | MR | Zbl

8. S. Ginsburg, The Mathematical Theory of Context Free Languages, Mc-Graw-Hill Book Company, New York, London, 1966. | MR | Zbl

10. J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation, Addison -Wesley, Reading, Mass, 1979. | MR | Zbl

11. G. Lallement, Semigroups and combinatorial applications, J. Wiley and Sons, New York, 1979. | MR | Zbl

12. A. Mazurkiewicz, Concurrent Program Schemes and Their Interpretations, DAIMI Rep. PB-78, Aarhus Univ., Aarhus, 1977.

13. A. Mazurkiewicz, Traces, Histories, Graphs: Instances of a Process Monoid, Lecture Notes in Computer Science, Vol. 176, 1984, pp.115-133. | MR | Zbl

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

15. J. Sakarovitch, On Regular Trace Languages, R.A.I.R.O., Inform. Théor. (to appear). | MR

16. A. Salomaa, Theory of automata, Pergamon Press, Oxford - New York, 1969. | MR | Zbl

17. A. Salomaa, Formal languages, Academic Press, New York, 1973. | MR | Zbl

18. M. Szijarto, A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours, Fund. Inform., Vol. 4, 1981, pp. 531-549. | MR | Zbl

19. A. Tarlecki, Notes on the Implementability of Formal Languages by Concurrent Systems, ICS PAS Rep. 481, Inst. of Comput. Sc., Polish Acad. of Sc., Warshaw, 1982.