Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 32, Number 4-6, 1998
Page(s) 141 - 152
DOI https://doi.org/10.1051/ita/1998324-601411
Published online 01 February 2017
  1. 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. [EuDML: 92250] [MR: 860763] [Zbl: 0612.68071]
  2. 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. 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. 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. 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. 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. 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. 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. [EuDML: 92219] [MR: 795769] [Zbl: 0601.68055]
  9. 9. V. DIEKERT and G. ROZENBERG (Eds.), The book of traces, World Scientific, 1995. [MR: 1478992]
  10. 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. 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. 12. M. H. HARRISON, Introduction to formal language theory, Addison-Wesley, 1978. [MR: 526397] [Zbl: 0411.68058]
  13. 13. A. MAZURKIEWICZ, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
  14. 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. 15. W. RYTTER, Some properties of trace languages, Fundamenta Informaticae, VII, 1984, pp. 117-127. [MR: 745541] [Zbl: 0546.68064]
  16. 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. 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]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.