Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aalbersberg, IJ.J. and Rozenberg, G., Theory of traces, Techn. Report 86-16, Univ. of Leiden, Leiden (1986)
Aalbersberg, IJ.J. and Welzl, E., Trace languages defined by regular string languages, RAIRO Inform. Théor. et Applic. 20 (1986) 103–119
Berstel, J., Transductions and Context-Free Languages, Teubner, Stuttgart (1979)
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–215
Bertoni, A., Mauri, G., and Sabadini, N., Equivalence and membership problems for regular trace languages, Lect. Notes in Comput. Sc. 140 (1982) 61–71
Berstel, J. and Sakarovitch, J., Recent results in the theory of rational sets, Lect. Notes in Comput. Sc. 233 (1986) 15–28
Choffrut, C., Free partially commutative monoids, Report 86–20, LITP, Univ. Paris 7, Paris (1986)
Cori, R. and Perrin, D., Automates et commutations partielles, RAIRO Inform. Théor. 19 (1985) 21–32
Duboc, C., Commutations dans les monoides libres: un cadre theorique pour l'etude du parallelisme, Thesis, Univ. de Rouen, Rouen (1986)
Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York-London (1966)
Harary, F, Graph Theory, Addison-Wesley, Reading, Massachusetts (1969)
Hopcroft, J.E. and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading-London (1979)
Ibarra, O.H., Reversal-bounded multicounter machines and their decision problems, J. ACM 25 (1978) 116–133
Mazurkiewicz, A., Concurrent program schemes and their interpretations, DAIMI Rep. PB-78, Aarhus Univ., Aarhus (1977)
Minsky, M.L., Computation: Finite and Infinite Machines, Prentence-Hall, London-Sydney (1967)
Wolk, E.S., A note on ‘The comparability graph of a tree', Proc. Amer. Math. Soc. 16 (1965) 17–20
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abalbersberg, I.J., Hoogeboom, H.J. (1987). Decision problems for regular trace languages. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_20
Download citation
DOI: https://doi.org/10.1007/3-540-18088-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18088-3
Online ISBN: 978-3-540-47747-1
eBook Packages: Springer Book Archive