๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some combinatorial properties of Sturmian words

โœ Scribed by Aldo de Luca; Filippo Mignosi

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
950 KB
Volume
136
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Random generation of finite Sturmian wor
Random generation of finite Sturmian words
โœ Jean Berstel; Michel Pocchiola ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 521 KB

We present a bijection between the set of factors of given length of Sturmian words and some set of triples of nonnegative integers. This bijection and its inverse are both computable in linear time. Its applications are: a bijective proof of Mignosi's formula for counting Sturmian words, a linear p

Some combinatorial properties of infinit
Some combinatorial properties of infinite words and applications to semigroup theory
โœ Giuseppe Pirillo; Stefano Varricchio ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 560 KB

This paper is concerned with finiteness conditions for finitely generated semigroups. First, we present a combinatorial result on infinite sequences from which an alternative proof of a theorem of Restivo and Reutenauer follows: a finitely generated semigroup is finite if and only if it is periodic