On the simplest centralizer of a language

DOI10.1051/ITA:2006014MaRDI QIDQ3431440zbMATH OpenOpenAlexFDO

Authors P. Massazza, Petri Salmela

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, https://eudml.org/doc/92800, https://semanticscholar.org/paper/9ae279fd7d286e77577f82c2c63e8afcc7a1156b

zbMATH Keywords

centralizerlexicographic ordercommutation equation

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1670850
• Commutation with codes
• Commutation with ternary sets of words
• Playing with Conway's problem
• Conway's problem for three-word sets.

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 2087489 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Codes conjugués
• Codes et motifs
• Commutation with codes
• Commutation with ternary sets of words
• Conway's problem for three-word sets.
• On equations for regular languages, finite automata, and sequential networks
• STACS 2005
• The commutation of finite sets: A challenging problem
• The equation \(a_ M=b^ Nc^ P\) in a free group

Cited in

(3)

• Conjugacy of finite biprefix codes
• Language equations
• Playing with Conway's problem

This page was built for publication: On the simplest centralizer of a language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431440)