Two techniques in the area of the star problem

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

Volumn 1644 LNCS, Issue , 1999, Pages 483-492

  Kirsten, Daniel ^a   Marcinkowski, Jerzy ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; STARS;

FINITE SET; RECOGNIZABLE LANGUAGES;

COMPUTABILITY AND DECIDABILITY;

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

References (16)

1. J. Berstel. Transductions and Context-Free Languages. B. G. Teubner, 1979.
2. P. Cartier, D. Foata. Problemes combinatoires de commutation et rearrangements, volume 85 of LNCS. Springer-Verlag, Berlin, 1969.
3. M. Clerbout, M. Latteux. Semi-commutations. Information and Computation, 73:59{74, 1987.
4. V. Diekert, 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, G. Rozenberg, editors. 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, B. Rozoy. Decidability of the star problem in A * x {b}*. Information Processing Letters, 44(2):65{71, 1992.
8. K. Hashiguchi. Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences, 24:233{244, 1982.
9. D. Kirsten. Some undecidability results related to the star problem in trace monoids. In C. Meinel and S. Tison, editors, STACS'99 Proceedings, volume 1563 of LNCS, pages 227{236. Springer-Verlag, Berlin, 1999.
10. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, 1977.
11. Y. Metivier. Une condition suffisante de reconnaissabilité dans un monoide partiellement commutatif. R.A.I.R.O. - Informatique Théorique et Applications, 20:121{127, 1986.
12. Y. Metivier, G. Richomme. On the star operation and the finite power property in free partially commutative monoids. Proceedings of STACS 94, volume 775 of LNCS, pages 341{352. Springer-Verlag, Berlin, 1994.
13. Y. Métivier, G. Richomme. New results on the star problem in trace monoids. Information and Computation, 119(2):240{251, 1995.
14. E. Ochmański. Regular Trace Languages (in Polish). PhD thesis, Warszawa, 1984.
15. 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.
16. J. Sakarovitch. The "last" decision problem for rational trace languages. In I. Simon, editor, LATIN'92 Proceedings, LNCS 583, pages 460{473. Springer, 1992.