Study of irreducible balanced pairs for substitutive languages

DOI10.1051/ITA:2007062zbMATH Open1155.68060OpenAlexW2097913123MaRDI QIDQ3537490FDOQ3537490

Authors: Julien Bernat 

Publication date: 7 November 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2008__42_4_663_0/

Recommendations

• Languages under substitutions and balanced words
• Balanced words
• scientific article; zbMATH DE number 148020
• Balances and Abelian complexity of a certain class of infinite ternary words
• Enumeration of irreducible binary words

zbMATH Keywords

balanced pairsalgorithm on wordssubstitutive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Cites Work

• Balanced words
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Geometric theory of unimodular Pisot substitutions
• Title not available (Why is that?)
• Pisot substitutions and Rauzy fractals
• A characterization of substitutive sequences using return words
• Episturmian words and some constructions of de Luca and Rauzy
• Substitution dynamical systems - spectral analysis
• Proximality in Pisot tiling spaces
• Représentation géométrique de suites de complexité $2n+1$
• Pure Discrete Spectrum for One-dimensional Substitution Systems of Pisot Type
• Substitutions in dynamics, arithmetics and combinatorics
• Palindromes in the Fibonacci word
• Imbalances in Arnoux-Rauzy sequences
• Self-affine tiling via substitution dynamical systems and Rauzy fractals.
• Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
• Atomic surfaces, tilings and coincidence. I: Irreducible case
• Substitutional dynamical systems, Bratteli diagrams and dimension groups
• Title not available (Why is that?)
• Palindromic complexity of infinite words associated with simple Parry numbers
• A generalization of Sturmian sequences: Combinatorial structure and transcendence
• A combinatorial property of the Fibonacci words
• Confluent linear numeration systems
• Title not available (Why is that?)
• Balances for fixed points of primitive substitutions.
• Geometric representation of substitutions of Pisot type
• Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
• Lattices and multi-dimensional words
• On a characteristic property of ARNOUX–RAUZY sequences
• On the dependence of numeration systems associated to the powers of a Pisot number
• The Tribonacci substitution
• Title not available (Why is that?)
• Symmetrized \(\beta \)-integers
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Languages under substitutions and balanced words

This page was built for publication: Study of irreducible balanced pairs for substitutive languages

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