On the simplest centralizer of a language
From MaRDI portal
Publication:3431440
DOI10.1051/ita:2006014zbMath1112.68097OpenAlexW2160339838MaRDI QIDQ3431440
Publication date: 10 April 2007
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_2_295_0
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The commutation of finite sets: A challenging problem
- Commutation with ternary sets of words
- Conway's problem for three-word sets.
- Commutation with codes
- Codes et motifs
- Codes conjugués
- STACS 2005