RAIRO-Theor. Inf. Appl.
Volume 40, Number 2, April-June 2006Alberto Bertoni: Climbing summits
|Page(s)||295 - 301|
|Published online||20 July 2006|
On the simplest centralizer of a language
Dipartimento di Informatica e Comunicazione,
Università degli Studi dell'Insubria,
via Mazzini 5, 21100 Varese, Italy;
2 Department of Mathematics and TUCS, University of Turku, 20014 Turku, Finland; email@example.com
Given a finite alphabet Σ and a language L ⊆ ∑+, the centralizer of L is defined as the maximal language commuting with it. We prove that if the primitive root of the smallest word of L (with respect to a lexicographic order) is prefix distinguishable in L then the centralizer of L is as simple as possible, that is, the submonoid L*. This lets us obtain a simple proof of a known result concerning the centralizer of nonperiodic three-word languages.
Mathematics Subject Classification: 68Q70 / 68R15
Key words: Commutation equation / centralizer / lexicographic order.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.