On Conjugacy of Languages (2001)
by
Julien Cassaigne
,
Juhani Karhumäki
,
Jan Manuch
,
Turku Centre
,
Computer Science
| Citations: | 1 - 0 self |
BibTeX
@MISC{Cassaigne01onconjugacy,
author = {Julien Cassaigne and Juhani Karhumäki and Jan Manuch and Turku Centre and Computer Science},
title = {On Conjugacy of Languages},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We say that two languages X and Y are conjugated if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated to this equation. For example, we characterize all sets which are conjugated via a two-element bipre x set Z, as well as all twoelement sets which are conjugates.
Citations
| 162 | Automata, languages and machines - Eilenberg - 1976 |
| 152 | The problem of solvability of equations in a free semigroup - Makanin - 1977 |
| 20 | Satisfiability of word equations with constants is in - Plandowski - 2004 |
| 5 | Codes et motifs - Ratoandramanana - 1989 |
| 5 | The commutation of sets: a challenging problem, Theoret - Chorut, Karhumaki, et al. - 2002 |
| 5 | On the centralizer of a set - Karhumaki, Petre |
| 4 | Regular algebra and machines - Conway - 1971 |
| 2 | Independent systems of equations, Chapter 14, in: M. Lothaire, Algebraic combinatorics on words - Harju, Karhumaki, et al. - 1997 |
| 2 | Combinatorial and computational problems on sets of words - Karhumaki - 2001 |
| 1 | On commutation and primitive roots of codes, TUCS - Harju, Petre - 2001 |
| 1 | Turku Centre for Computer Science Lemminkaisenkatu 14 FIN-20520 Turku Finland http://www.tucs.abo - Leiss, equations, et al. - 1998 |
