Walnut

swMATH30122MaRDI QIDQ41836FDOQ41836

Author name not available (Why is that?)

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

Cited In (39)

• Additive number theory via automata theory
• Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
• The Logical Approach to Automatic Sequences
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Computing the \(k\)-binomial complexity of the Thue-Morse word
• Abelian-square-rich words
• Synchronized sequences
• Abelian Complexity and Synchronization
• Ostrowski-automatic sequences: theory and applications
• Repetitions in infinite palindrome-rich words
• Subword complexity and power avoidance
• 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
• Automaticity and Invariant Measures of Linear Cellular Automata
• 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
• Circular critical exponents for Thue–Morse factors
• 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
• Critical exponent of infinite balanced words via the Pell number system
• First-Order Logic and Numeration Systems
• Deciding game invariance
• Lie complexity of words
• Frobenius Numbers and Automatic Sequences

This page was built for software: Walnut