In this paper we study the set P(ω) of binary patterns that can occur in one infinite binary word ω, comparing it with the set F(ω) of factors of the word.
Abstract. In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w).
In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w , comparing it with the set F(w) of factors of the word.
Apr 12, 2011 · There are an infinite number of cube-free binary words. Let w be one such word (such as the Thue-Morse word). Let w ...
Missing: Patterns | Show results with:Patterns
A binary word te A, A = {a, b}, is strongly avoidable on A if and only if it is avoidable on A. Our proof is based on the existence of an infinite independent ...
Mar 30, 2022 · An infinite binary word is a string (a1,⋯,an,⋯) where an∈{0,1} My claim is that the set E is unaccountable. When n=2 then a=(a1,s2,s3,⋯) ...
Missing: Patterns | Show results with:Patterns
... binary pattern [t] can be avoided by an infinite independent set of binary words, and, the number of binary words avoiding [t] grows exponentially with their ...
We denote by B the set of all one-sided infinite binary words. For x E B the nth symbol of x is denoted by x(n) and X stands for a word satisfying x(n) ...
Feb 27, 2024 · Is there a notion of binary numbers where there are no repeated patterns completely going through the binary number. I.E. 101010 is "divisible" ...
An infinite recurrent word avoiding AABBCABBA also avoids the patterns AABBA and AAAA. This remark is a straightforward consequence of the property on formulas ...