Geodesic
Study of irreducible balanced pairs for substitutive languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 4, pp. 663-678

Voir la notice de l'article provenant de la source Numdam

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.

DOI : 10.1051/ita:2007062
Classification : 68R15
Keywords: substitutive languages, balanced pairs, algorithm on words 
@article{ITA_2008__42_4_663_0,
     author = {Bernat, Julien},
     title = {Study of irreducible balanced pairs for substitutive languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {663--678},
     publisher = {EDP-Sciences},
     volume = {42},
     number = {4},
     year = {2008},
     doi = {10.1051/ita:2007062},
     mrnumber = {2458700},
     zbl = {1155.68060},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2007062/}
}
TY  - JOUR
AU  - Bernat, Julien
TI  - Study of irreducible balanced pairs for substitutive languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2008
SP  - 663
EP  - 678
VL  - 42
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita:2007062/
DO  - 10.1051/ita:2007062
LA  - en
ID  - ITA_2008__42_4_663_0
ER  - 
%0 Journal Article
%A Bernat, Julien
%T Study of irreducible balanced pairs for substitutive languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2008
%P 663-678
%V 42
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita:2007062/
%R 10.1051/ita:2007062
%G en
%F ITA_2008__42_4_663_0
Bernat, Julien. Study of irreducible balanced pairs for substitutive languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 4, pp. 663-678. doi: 10.1051/ita:2007062

Cité par Sources :