On a Family of Morphic Images of Arnoux-Rauzy Words

Authors:
Michelangelo Bucci;Alessandro Luca
Affiliations:
Dipartimento di Matematica e Applicazioni "R. Caccioppoli", Università degli Studi di Napoli Federico II, Napoli, Italy 80126;Dipartimento di Matematica e Applicazioni "R. Caccioppoli", Università degli Studi di Napoli Federico II, Napoli, Italy 80126
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 9
Cited 2

A characterization of substitutive sequences using return words

Discrete Mathematics
Episturmian words and some constructions of de Luca and Rauzy

Theoretical Computer Science
Finiteness and Regularity in Semigroups and Formal Languages

Finiteness and Regularity in Semigroups and Formal Languages
Episturmian words and episturmian morphisms

Theoretical Computer Science
Palindromic prefixes and episturmian words

Journal of Combinatorial Theory Series A
Pseudopalindrome closure operators in free monoids

Theoretical Computer Science
On different generalizations of episturmian words

Theoretical Computer Science
On θ-episturmian words

European Journal of Combinatorics
Sturmian and episturmian words: a survey of some recent results

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics

Infinite words rich and almost rich in generalized palindromes

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Palindromic richness for languages invariant under more symmetries

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N *** 0 be an integer. Suppose that all left special factors of s longer than N are prefixes of s , and that s has at most one right special factor of each length greater than N . Then s is a morphic image, under an injective morphism, of a suitable standard Arnoux-Rauzy word.