A note on decidability questions on presentations of word semigroups

Theoretical Computer Science

Volumn 183, Issue 1, 1997, Pages 83-92

  Choffrut, C ^a   Harju, T ^b   Karhumaki, J ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FINITE AUTOMATA;

WORD SEMIGROUPS;

FORMAL LANGUAGES;

EID: 0031210352     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00311-8     Document Type: Article

References (15)

1. M.H. Albert and J. Lawrence, A proof of Ehrenfeucht's Conjecture, Theoret. Comput. Sci. 41 (1985) 121-123.
2. J. Berstel, Transductions and Context-Free Languages (B.G. Teubner, Stuttgart, 1979).
3. J. Berstel and D. Perrin, Theory of Codes (Academic Press, New York, 1986).
4. C. Choffrut and J. Karhumäki, Combinatorics of words, in: G. Rozenberg and A. Salomaa, eds., Handbook of Formal Languages, Vol. I (Springer, Berlin, 1996), to appear.
5. K. Culik II and J. Karhumäki, Systems of equations over a free monoid and Ehrenfeucht's Conjecture, Discrete Math. 43 (1983) 139-153.
6. P. Dubreil, Sur le demi-groupe des endomorhismes d'une algébre abstraite, Lincei-Rend. Sc. Fis. mat. Nat. 46 (1969) 149-153.
7. V.S. Guba, The equivalence of infinite systems of equations in free groups and semigroups with finite subsystems, Mat. Zametki 40 (1986) 321-324 (in Russian).
8. T. Harju and J. Karhumäki, On the defect theorem and simplifiability, Semigroup Forum 33 (1986) 199-217.
9. T. Harju and J. Karhumäki, Morphisms, in: G. Rozenberg and A. Salomaa, eds., Handbook of Formal Languages, Vol. I (Springer, Berlin, 1996), to appear.
10. J.M. Howie, An Introduction to Semigroup Theory (Academic Press, London, 1976).
11. J. Karhumäki and Y. Maon, A simple undecidable problem: existential agreement of inverses of two morphisms on a regular language, J. Comput. System Sci. 32 (1986) 315-322.
12. G. Lallement, Semigroups and Combinatorial Applications (Wiley, New York, 1979).
13. M.Y. Lecerf, Récursive insolubilité de l'équation générale de diagonalisation de deux monomorphismes de monoïdes libres αx = βx, Comptes Rendus 257 (1963) 2940-2943.
14. A. Markov, Impossibility of algorithms for recognizing some properties of associative systems, Dokl. Akad. Nauk SSSR 77 (1951) 953-956 (in Russian).
15. Al.A. Markov, On finitely generated subsemigroups of a free semigroup, Semigroup Forum 3 (1971) 251-258.