Searching for "Recurrence in Infinite Words." – sorted by Relevance.
15 documents found, showing 1 through 10.
Next 10 →
-
Strongly Almost Periodic Sequences under Finite Automata Mappings. Matematicheskie Zametki
- … the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first…
- Cited by 1 (0 self) – Add To MetaCart
-
Occurrences of palindromes in characteristic Sturmian words, Theoret
- … uniformly recurrent infinite word, any (palindromic) factor of cα occurs infinitely many times in cα…
- Cited by 1 (1 self) – Add To MetaCart
-
Return Words In Sturmian And Episturmian Words
- …. Considering each occurrence of a word w in a recurrent infinite word, we define the set of return words of w…
- Cited by 13 (3 self) – Add To MetaCart
-
unknown title
- … of an involutory antimorphism θ of the free monoid A ∗ . We show that given a recurrent infinite word ω ∈ A N…
- Add To MetaCart
-
A characterization of Sturmian words by return words
- … = uwv: An infinite word U is called recurrent if every factor of U appears infinitely many times in U…
- Cited by 11 (5 self) – Add To MetaCart
-
A positive pumping condition for regular sets
- … be an infinite word. We say that b is uniformly recurrent if there exists a function c: A ∗ → N such that if w, v…
- Cited by 1 (0 self) – Add To MetaCart
-
Order and quasiperiodicity in episturmian words (Extended Abstract)
- … here is that, for any aperiodic infinite word x which is uniformly recurrent, min(x) is an infinite…
- Cited by 1 (1 self) – Add To MetaCart
-
Characterizations of finite and infinite episturmian words via lexicographic orderings
- … strict episturmian word, or a strict episkew word (i.e., a particular kind of non-recurrent infinite word…
- Cited by 7 (4 self) – Add To MetaCart
-
Theoretical Informatics and Applications Will be set by the publisher DOI: (will be inserted later) SEQUENCES OF LOW ARITHMETICAL COMPLEXITY
- … complexity. An infinite word w ∈ Σω is called uniformly recurrent if all its factors occur in it an infinite…
- Add To MetaCart
-
On the Number of Return Words in Infinite Words with Complexity 2n + 1
- … ? We first give the definition of return words for a recurrent infinite word in a finite alphabet (a…
- Cited by 2 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
