Brik's infinite binary sequence is recurrent but not uniformly recurrent, has exponential factor complexity, is not morphic, and has a transcendental density of 1s.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Balance properties of Fibonacci word rectangles are decidable by finite automata, generalized to all Sturmian characteristic words with quadratic irrational slopes, and tested for Tribonacci and Thue-Morse words.
citing papers explorer
-
Brik's sequence: a strange recursion
Brik's infinite binary sequence is recurrent but not uniformly recurrent, has exponential factor complexity, is not morphic, and has a transcendental density of 1s.
-
Balanced Fibonacci word rectangles, and beyond
Balance properties of Fibonacci word rectangles are decidable by finite automata, generalized to all Sturmian characteristic words with quadratic irrational slopes, and tested for Tribonacci and Thue-Morse words.