Asymptotic behaviour of bi-infinite words

DOI10.1051/ita:2004002zbMath1082.68050OpenAlexW2162370531MaRDI QIDQ4825387

Wit Foryś

Publication date: 28 October 2004

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

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

zbMATH Keywords

bi-infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Sets of primitive words given by fixed points of mappings
• The poset of retracts of a free monoid
• On the periodicity of morphisms on free monoids
• Expanded subalphabets in the theories of languages and semigroups†
• Simplifications of homomorphisms
• THE BOUNDARY OF ITERATED MORPHISMS ON FREE SEMI-GROUPS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic behaviour of bi-infinite words