Walnut

swMATH30122MaRDI QIDQ41836FDOQ41836

Author name not available (Why is that?)

Official website: https://arxiv.org/abs/1603.06017

Source code repository: https://github.com/hamousavi/Walnut

Cited In (48)

• Additive number theory via automata theory
• Circular critical exponents for Thue-Morse factors
• Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
• The Logical Approach to Automatic Sequences
• The undirected repetition threshold and undirected pattern avoidance
• A family of formulas with reversal of high avoidability index
• Some further results on squarefree arithmetic progressions in infinite words
• Say no to case analysis: automating the drudgery of case-based proofs
• Title not available (Why is that?)
• On the boundary sequence of an automatic sequence
• Computing the \(k\)-binomial complexity of the Thue-Morse word
• First-order logic and numeration systems
• Abelian-square-rich words
• Synchronized sequences
• Ostrowski-automatic sequences: theory and applications
• Repetitions in infinite palindrome-rich words
• Subword complexity and power avoidance
• The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
• Intertwining of complementary Thue-Morse factors
• A Frameless 2-Coloring of the Plane Lattice
• The weak circular repetition threshold over large alphabets
• The simplest binary word with only three squares
• Squarefree words with interior disposable factors
• Critical exponents of infinite balanced words
• When is an automatic set an additive basis?
• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• Grail
• OEIS
• TaPAS
• AutoSquared
• CatalanCC
• DelannoyLS
• MotzkinCC
• EERTREE
• Frobenius numbers and automatic sequences
• Pecan
• Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton
• Automatic winning shifts
• Properties of a class of Toeplitz words
• Topological invariants for words of linear factor complexity
• Extremal overlap-free and extremal \(\beta\)-free binary words
• Prefixes of the Fibonacci word that end with a cube
• Additive Number Theory via Approximation by Regular Languages
• Automaticity and invariant measures of linear cellular automata
• Critical exponent of infinite balanced words via the Pell number system
• Abelian complexity and synchronization
• Deciding game invariance
• Lie complexity of words

This page was built for software: Walnut