Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. A. ARNOLD, “A syntactic congruence for rational ω-languages”, Theoretical Computer Science 39, p. 333–335, 1985.
2. I.J. AALBERSBERG and G. ROZENBERG, “Theory of traces”, Theoretical Computer Science 60, p. 1–82, 1988.
3. I.J. AALBERSBERG and E. WELZL, “Traces languages defined by regular string languages”, RAIRO Theoretical Informatics and Applications 20, p. 103–119, 1986.
4. A. BERTONI, G. MAURI and N. SABADINI, “Membership problem for regular and context-free trace languages”, Information and Computation 82, p. 135–150, 1989.
5. P. BONIZZONI, G. MAURI and G. PIGHIZZINI, “About infinite traces”, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universität München, 1989.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Formal Choreographic Languages;Lecture Notes in Computer Science;2022
2. Concurrency Traces;Paradigms of Concurrency;2022
3. Conclusions;Paradigms of Concurrency;2022
4. Step traces;Acta Informatica;2015-06-10
5. Fixed points of endomorphisms of trace monoids;Semigroup Forum;2013-11-27