Walnut
From MaRDI portal
Software:41836
No author found.
Source code repository: https://github.com/hamousavi/Walnut
Related Items (39)
Abelian-square-rich words ⋮ Synchronized sequences ⋮ Abelian Complexity and Synchronization ⋮ Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability ⋮ Lie complexity of words ⋮ Squarefree words with interior disposable factors ⋮ Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ When is an automatic set an additive basis? ⋮ The Logical Approach to Automatic Sequences ⋮ Automatic winning shifts ⋮ Properties of a class of Toeplitz words ⋮ Topological invariants for words of linear factor complexity ⋮ Critical exponents of infinite balanced words ⋮ Prefixes of the Fibonacci word that end with a cube ⋮ Frobenius Numbers and Automatic Sequences ⋮ A family of formulas with reversal of high avoidability index ⋮ Unnamed Item ⋮ First-Order Logic and Numeration Systems ⋮ Extremal overlap-free and extremal \(\beta\)-free binary words ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ Unnamed Item ⋮ On the boundary sequence of an automatic sequence ⋮ Additive number theory via automata theory ⋮ Deciding game invariance ⋮ Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ Circular critical exponents for Thue–Morse factors ⋮ Unnamed Item ⋮ Subword complexity and power avoidance ⋮ Critical exponent of infinite balanced words via the Pell number system ⋮ Repetitions in infinite palindrome-rich words ⋮ Some further results on squarefree arithmetic progressions in infinite words ⋮ Additive Number Theory via Approximation by Regular Languages ⋮ A Frameless 2-Coloring of the Plane Lattice ⋮ The weak circular repetition threshold over large alphabets ⋮ The simplest binary word with only three squares ⋮ Say no to case analysis: automating the drudgery of case-based proofs
This page was built for software: Walnut
