Analysis of algorithms for the recognition of rational and context-free trace languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 4-6, pp. 141-152. 
@article{ITA_1998__32_4-6_141_0,
     author = {Avellone, A. and Goldwurm, M.},
     title = {Analysis of algorithms for the recognition of rational and context-free trace languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {141--152},
     publisher = {EDP-Sciences},
     volume = {32},
     number = {4-6},
     year = {1998},
     mrnumber = {1672719},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1998__32_4-6_141_0/}
}
TY  - JOUR
AU  - Avellone, A.
AU  - Goldwurm, M.
TI  - Analysis of algorithms for the recognition of rational and context-free trace languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1998
SP  - 141
EP  - 152
VL  - 32
IS  - 4-6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1998__32_4-6_141_0/
LA  - en
ID  - ITA_1998__32_4-6_141_0
ER  - 
%0 Journal Article
%A Avellone, A.
%A Goldwurm, M.
%T Analysis of algorithms for the recognition of rational and context-free trace languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1998
%P 141-152
%V 32
%N 4-6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1998__32_4-6_141_0/
%G en
%F ITA_1998__32_4-6_141_0
Avellone, A.; Goldwurm, M. Analysis of algorithms for the recognition of rational and context-free trace languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 4-6, pp. 141-152. http://archive.numdam.org/item/ITA_1998__32_4-6_141_0/

1. I. J. Aalbersberg and E. Welzl, Trace languages defined by regular string languages, R.A.I.R.O. - Informatique Théorique et Applications, 1986, 20, pp. 103-119. | Numdam | MR | Zbl

2. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974. | MR | Zbl

3. A. Bertoni and M. Goldwurm, On the prefixes of a random trace and the membership problem for context-free trace languages. In L. HUGUET and A. POLI, eds, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Proceedings AAECC 5), Menorca (Spain) June 15-19, 1987, number 356 in Lecture Notes in Computer Science, pp. 35-59, Berlin-Heidelberg-New York, 1989, Springer. | MR | Zbl

4. A. Bertoni, M. Goldwurm and N. Sabadini, Analysis of a class of algorithms for problems on trace languages. In Th. BETH and M. CLAUSEN, eds., Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra (Proceedings AAECC 4), Karlsruhe (FRG) September 23-26, 1986, number 307 in Lecture Notes in Computer Science, pp. 202-214, Berlin-Heidelberg-New York, 1988, Springer. | MR | Zbl

5. A. Bertoni, G. Mauri and N. Sabadini, Context-free trace languages, In Proceedings 7th Coll. on Trees in Algebra and Programming (CAAP), Lille (France), 1982, pp. 32-42. | Zbl

6. A. Bertoni, G. Mauri and N. Sabadini, Equivalence and membership problems for regular trace languages, In Proc. 9th ICALP, number 140 in Lecture Notes in Computer Science, pp. 61-71, Berlin-Heidelberg-New York, 1982, Springer. | MR | Zbl

7. A. Bertoni, G. Mauri and N. Sabadini, Membership problems for regular and context free trace languages, Information and Computation, 1989, 82, pp. 135-150. | MR | Zbl

8. R. Cori and D. Perrin, Automates et commutations partielles, R.A.I..R.O. - Informatique Théorique et Applications, 1985, 19 (1), pp. 21-32. | Numdam | MR | Zbl

9. V. DIEKERT and G. ROZENBERG (Eds.), The book of traces, World Scientific, 1995. | MR

10. C. Duboc, Commutations dans des monoides libres : un cadre théorique pour l'étude du parallélisme. Thèse, Faculté des Sciences de l'Université de Rouen, 1986.

11. M. Goldwurm, Probabilistic estimation of the number of prefixes of a trace, Theoretical Computer Science, 1992, 92, pp. 249-268. | MR | Zbl

12. M. H. Harrison, Introduction to formal language theory, Addison-Wesley, 1978. | MR | Zbl

13. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.

14.E. Ochmanski, Regular behaviour of concurrent Systems, Bulletin of the European Association for Theoretical Computer Science (EATCS), Oct 1985, 27, pp. 56-67.

15. W. Rytter, Some properties of trace languages, Fundamenta Informaticae, VII, 1984, pp. 117-127. | MR | Zbl

16. M. Szujártó, A classification and closure properties of languages for describing concurrent System behaviours, Fundamenta Informaticae, 1981, 4 (3), pp. 531-549. | MR | Zbl

17. L. G. Valiant, General context-free recognition in less than cubic time, Journal of Computer and System Sciences, 1975, 10, pp. 308-315. | MR | Zbl