Analysis of algorithms for the recognition of rational and context-free trace languages
Avellone, A. ; Goldwurm, M.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998), p. 141-152 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1998-01-01
@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},
     volume = {32},
     year = {1998},
     pages = {141-152},
     mrnumber = {1672719},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 141-152. http://gdmltest.u-ga.fr/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 860763 | Zbl 0612.68071

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

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 1008528 | Zbl 0679.68134

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 950738 | Zbl 0648.68079

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 0548.68072

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 675445 | Zbl 0486.68079

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 1010929 | Zbl 0682.68040

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 795769 | Zbl 0601.68055

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

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 1148573 | Zbl 0747.68034

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

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 745541 | Zbl 0546.68064

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 678010 | Zbl 0486.68074

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 428796 | Zbl 0312.68042