A connection between the star problem and the finite power property in trace monoids? (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 473-482

  Kirsten, Daniel ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; STARS;

EXTENDED ABSTRACTS; MONOIDS; POWER PROBLEM;

ALGEBRA;

EID: 22644450662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_44     Document Type: Conference Paper

References (23)

1. J. Berstel. Transductions and Context-Free Languages. B.G.Teubner, Stuttg., 1979.
2. P. Cartier and D. Foata. Problemes combinatoires de commutation et réarrangements, volume 85 of LNCS. Springer-Verlag, Berlin, 1969.
3. M. Clerbout and M. Latteux. Semi-commutations. Inf. and Comp., 73:59{74, 1987.
4. V. Diekert and Y. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 3, Beyond Words, pages 457{534. Springer-Verlag, Berlin, 1997.
5. V. Diekert and G. Rozenberg, eds., The Book of Traces. World Scientific, 1995.
6. M. Fliess. Matrices de Hankel. J. Math. Pures et Appl., 53:197{224, 1974.
7. P. Gastin, E. Ochmański, A. Petit, and B. Rozoy. Decidability of the star problem in a * x {b}. Information Processing Letters, 44(2):65{71, 1992.
8. S. Ginsburg and E. Spanier. Bounded regular sets. In Proceedings of the AMS, volume 17:5, pages 1043{1049, 1966.
9. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16:285{296, 1966.
10. P. A. Grillet. Semigroups: An Introduction to the Structure Theory, volume 193 of Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, Inc., New York, 1995.
11. K. Hashiguchi. A decision procedure for the order of regular events. Theoretical Computer Science, 8:69{72, 1979.
12. D. Kirsten. A connection between the star problem and the finite power property in trace monoids. Technical Report ISSN 1430-211X, TUD/FI98/09, Department of Computer Science, Dresden University of Technology, October 1998.
13. D. Kirsten and G. Richomme. Decidability equivalence between the star problem and the finite power problem in trace monoids. Technical Report ISSN 1430-211X, TUD/FI99/?, Department of Computer Science, Dresden University of Technology and Technical Report at LaRIA, Universite de Picardie Jules Verne, Amiens, April 1999 (submitted).
14. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, 1977.
15. Y. Métivier. Une condition suffisante de reconnaissabilit-e dans un monöde partiellement commutatif. R.A.I.R.O. - Inform. Théorique et Appl., 20:121{127, 1986.
16. Y. Métivier and G. Richomme. New results on the star problem in trace monoids. Information and Computation, 119(2):240{251, 1995.
17. E. Ochmański. Recognizable trace languages. Chapter 6 in [5], pages 167-204.
18. E. Ochmański. Regular Trace Languages (in Polish). PhD thesis, Warszawa, 1984.
19. E. Ochmański. Notes on a star mystery. Bulletin of the EATCS, 40:252{257, 1990.
20. G. Richomme. Decidability equivalence between the star problem and the finite power property problem in trace monoids. Internal report 835-94, LaBRI - Université Bordeaux I, 1994.
21. 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, volume 841 of LNCS, pages 577{586. Springer-Verlag, Berlin, 1994.
22. J. Sakarovitch. The "last" decision problem for rational trace languages. In I. Simon, editor, LATIN'92 Proceedings, volume 583 of LNCS, pages 460{473. Springer- Verlag, Berlin, 1992.
23. I. Simon. Limited subsets of a free monoid. In Proceedings of the 19th IEEE Annual Symposium on Foundations of Computer Science, pages 143{150. North Carolina Press, 1978.