RAIRO-Theor. Inf. Appl.
Volume 42, Number 4, October-December 2008Fibonacci words
|Page(s)||663 - 678|
|Section||Topical issue: Fibonacci Words|
|Published online||15 January 2008|
Study of irreducible balanced pairs for substitutive languages
IML CNRS UMR 6206 Campus de Luminy, Case 907 13288 Marseille, Cedex 9, France; email@example.com
Accepted: 23 November 2007
Let be a language. A balanced pair (u,v) consists of two words u and v in which have the same number of occurrences of each letter. It is irreducible if the pairs of strict prefixes of u and v of the same length do not form balanced pairs. In this article, we are interested in computing the set of irreducible balanced pairs on several cases of languages. We make connections with the balanced pairs algorithm and discrete geometrical constructions related to substitutive languages. We characterize substitutive languages which have infinitely many irreducible balanced pairs of a given form.
Mathematics Subject Classification: 68R15
Key words: Substitutive languages / balanced pairs / algorithm on words.
© EDP Sciences, 2008
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.