Characterization of substitution invariant words coding exchange of three intervals.
Baláži, Peter, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
Baláži, Peter, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
Martin, Jeremy L., Wagner, Jennifer D. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Petr Kůrka (2003)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Stephen L. Bloom, Zoltán Ésik (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
Makoto Ozawa, Yukihiro Tsutsumi (2007)
Revista Matemática Complutense
Similarity:
Valérie Berthé, Hiromi Ei, Shunji Ito, Hui Rao (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
Sturmian words are infinite words that have exactly factors of length for every positive integer . A Sturmian word is also defined as a coding over a two-letter alphabet of the orbit of point under the action of the irrational rotation (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give an alternative ...
Arnoux, Pierre, Berthé, Valérie, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity: