Decision problems for regular trace languages

  • IJsbrand Jan Abalbersberg
  • Hendrik Jan Hoogeboom
Formal Languages And Automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


We solve the open problem of characterizing those concurrency alphabets for which the equivalence problem for regular trace languages is decidable. We also give a characterization for the cases in which the intersection emptiness problem is decidable.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AalRoz]
    Aalbersberg, IJ.J. and Rozenberg, G., Theory of traces, Techn. Report 86-16, Univ. of Leiden, Leiden (1986)Google Scholar
  2. [AalWel]
    Aalbersberg, IJ.J. and Welzl, E., Trace languages defined by regular string languages, RAIRO Inform. Théor. et Applic. 20 (1986) 103–119Google Scholar
  3. [Ber]
    Berstel, J., Transductions and Context-Free Languages, Teubner, Stuttgart (1979)Google Scholar
  4. [BerBraMauSab]
    Bertoni, A., Brambilla, M., Mauri, G., and Sabadini, N., An application of the theory of free partially commutative monoids: asymptotic densities of trace languages, Lect. Notes in Comput. Sc. 118 (1981) 205–215Google Scholar
  5. [BerMauSab]
    Bertoni, A., Mauri, G., and Sabadini, N., Equivalence and membership problems for regular trace languages, Lect. Notes in Comput. Sc. 140 (1982) 61–71Google Scholar
  6. [BerSak]
    Berstel, J. and Sakarovitch, J., Recent results in the theory of rational sets, Lect. Notes in Comput. Sc. 233 (1986) 15–28Google Scholar
  7. [Cho]
    Choffrut, C., Free partially commutative monoids, Report 86–20, LITP, Univ. Paris 7, Paris (1986)Google Scholar
  8. [CorPer]
    Cori, R. and Perrin, D., Automates et commutations partielles, RAIRO Inform. Théor. 19 (1985) 21–32Google Scholar
  9. [Dub]
    Duboc, C., Commutations dans les monoides libres: un cadre theorique pour l'etude du parallelisme, Thesis, Univ. de Rouen, Rouen (1986)Google Scholar
  10. [Gin]
    Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York-London (1966)Google Scholar
  11. [Har]
    Harary, F, Graph Theory, Addison-Wesley, Reading, Massachusetts (1969)Google Scholar
  12. [HopU11]
    Hopcroft, J.E. and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading-London (1979)Google Scholar
  13. [Iba]
    Ibarra, O.H., Reversal-bounded multicounter machines and their decision problems, J. ACM 25 (1978) 116–133Google Scholar
  14. [Maz]
    Mazurkiewicz, A., Concurrent program schemes and their interpretations, DAIMI Rep. PB-78, Aarhus Univ., Aarhus (1977)Google Scholar
  15. [Min]
    Minsky, M.L., Computation: Finite and Infinite Machines, Prentence-Hall, London-Sydney (1967)Google Scholar
  16. [Wol]
    Wolk, E.S., A note on ‘The comparability graph of a tree', Proc. Amer. Math. Soc. 16 (1965) 17–20Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • IJsbrand Jan Abalbersberg
    • 1
  • Hendrik Jan Hoogeboom
    • 1
  1. 1.Department of Computer ScienceRijks Universiteit LeidenLeidenThe Netherlands

Personalised recommendations