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.
Cite
CITATION STYLE
APA
Abalbersberg, Ij. J., & Hoogeboom, H. J. (1987). Decision problems for regular trace languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 267 LNCS, pp. 250–259). Springer Verlag. https://doi.org/10.1007/3-540-18088-5_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free