Decidability equivalence between the star problem and the finite power problem in trace monoids

Theory of Computing Systems

Volumn 34, Issue 3, 2001, Pages 193-227

  Kirsten, D ^a   Richomme, G ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERMEDIATE RESULTS; MONOIDS; POWER PROBLEM; RECOGNIZABLE LANGUAGES; TRACE MONOID;

STARS;

COMPUTABILITY AND DECIDABILITY;

EID: 0035607401     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240011006     Document Type: Article

References (31)

1. J. Berstel. Transductions and Context-Free Languages. B. G. Teubner, Stuttgart, 1979.
2. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Volume 85 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1969.
3. M. Clerbout and M. Latteux. Semi-commutations. Information and Computation, 73:59-74, 1987.
4. A. H. Clifford and G. B. Preston. The Algebraic Theory of Semigroups, volume I. American Mathematical Society, Providence, RI, 1961.
5. R. Cori and D. Perrin. Automates et commutations partielles. RAIRO - Informatique Théorique et Applications, 19:21-32, 1985.
6. V. Diekert and Y. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, pages 457-534. Springer-Verlag, Berlin, 1997.
7. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
8. S. Eilenberg. Automata, Languages, and Machines, Volume A. Academic Press, New York, 1974.
9. M. Fliess. Matrices de Hankel. Journal de Mathématiques Pures et Appliquées, 53:197-224, 1974.
10. P. Gastin, E. Ochmański, A. Petit, and B. Rozoy. Decidability of the star problem in A* × {b}*. Information Processing Letters, 44(2):65-71, 1992.
11. S. Ginsburg and E. Spanier. Bounded regular sets. Proceedings of the AMS, 17(5): 1043-1049, 1966.
12. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16:285-296, 1966.
13. P. A. Grillet. Semigroups: An Introduction to the Structure Theory. Volume 193 of Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York, 1995.
14. K. Hashiguchi. A decision procedure for the order of regular events. Theoretical Computer Science, 8:69-72, 1979.
15. K. Hashiguchi. Recognizable closures and submonoids of free partially commutative monoids. Theoretical Computer Science, 86:233-241, 1991.
16. D. Kirsten. A connection between the star problem and the finite power property in trace monoids. In P. van Emde Boas et al., editors, ICALP '99 Proceedings, pages 473-482. Volume 1644 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
17. D. Kirsten and J. Marcinkowski. Two techniques in the area of the star problem. In P. van Emde Boas et al., editors, ICALP' 99 Proceedings, pages 483-492. Volume 1644 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
18. M. Linna. Finite power property for regular languages. In M. Nivat, editor, Automata, Languages and Programming, pages 87-98. North-Holland, Amsterdam, 1973.
19. A. Mazurkiewicz. Concurrent Program Schemes and Their Interpretations. DAIMI Rep. PB 78, Aarhus University, 1977.
20. Y. Métivier. Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. RAIRO - Informatique Théorique et Applications, 20:121-127, 1986.
21. Y. Métivier and G. Richomme. On the star operation and the finite power property in free partially commutative monoids. In P. Enjalbert et al., editors, STACS '94 Proceedings, pages 341-352. Volume 775 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
22. Y. Métivier and G. Richomme. New results on the star problem in trace monoids. Information and Computation, 119(2):240-251, 1995.
23. E. Ochmański. Regular Trace Languages (in Polish). Ph.D. thesis, Warszawa, 1984.
24. E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the EATCS, 27:56-67, 1985.
25. E. Ochmański. Notes on a star mystery. Bulletin of the EATCS, 40:252-257, 1990.
26. E. Ochmanski. Recognizable trace languages. In V. Diebert and G. Rozenberg, editors, Book of Traces, Chapter 6, pages 167-204. World Scientific, Singapore, 1995
27. G. Pighizzini. Recognizable Trace Languages and Asynchronous Automata. Ph.D. thesis, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milan, 1993.
28. G. Pighizzini. Synthesis of nondeterministic asynchronous automata. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, pages 109-126. Number 5 in Algebra, Logic and Applications. Gordon and Breach, New York, 1993.
29. G. Richomme. Some trace monoids where both the star problem and the finite power property problem are decidable. In I. Privara et al., editors, MFCS '94 Proceedings, pages 577-586. Volume 841 of Lecture Notes in Computer Science.Springer-Verlag, Berlin, 1994.
30. J. Sakarovitch. The "last" decision problem for rational trace languages. In I. Simon, editor, LATIN '92 Proceedings, pages 460-473. Volume 583 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.
31. I. Simon. Limited subsets of a free monoid. In Proceedings of the 19th IEEE Annual Symposium on Foundations of Computer Science, pages 143-150. IEEE Computer Society Press, Long Beach, CA, 1978.