Commutation with ternary sets of words

DOI10.1007/s00224-004-1191-1zbMath1066.68102OpenAlexW1970186299MaRDI QIDQ1771315

Ion Petre, Michel Latteux, Juhani Karhumäki

Publication date: 19 April 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1191-1

zbMATH Keywords

commutation of languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (5)

On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Commutation with codes ⋮ Simple equations on binary factorial languages ⋮ Conjugacy of finite biprefix codes ⋮ On the simplest centralizer of a language

This page was built for publication: Commutation with ternary sets of words