On Conjugacy of Languages
From MaRDI portal
Publication:3147021
DOI10.1051/ita:2001130zbMath1005.68121OpenAlexW2068540545MaRDI QIDQ3147021
Ján Maňuch, Julien Cassaigne, Juhani Karhumäki
Publication date: 18 September 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_6_535_0
Related Items
Conjugacy relations of prefix codes ⋮ Towards Decidability of Conjugacy of Pairs and Triples ⋮ Conjugacy of finite biprefix codes
Cites Work
- The commutation of finite sets: A challenging problem
- Satisfiability of word equations with constants is in NEXPTIME
- Codes et motifs
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Compactness of Systems of Equations in Semigroups
- Codes conjugués
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item