Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T06:24:24.753Z Has data issue: false hasContentIssue false

Study of irreducible balanced pairsfor substitutive languages

Published online by Cambridge University Press:  15 January 2008

Julien Bernat*
Affiliation:
IML CNRS UMR 6206 Campus de Luminy, Case 907 13288 Marseille, Cedex 9, France; bernat@iml.univ-mrs.fr
Get access

Abstract

Let $\mathcal{L}$ be a language.A balanced pair (u,v) consists of two words u and v in $\mathcal{L}$ which have the same number ofoccurrences 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.

Information

Type
Research Article
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable