Automatic Theorem Proving in Walnut. Walnut is a software package that implements a mechanical decision procedure for deciding certain combinatorial properties of some special words referred to as automatic words or automatic sequences. Walnut is written in Java and is open source. It is licensed under GNU General Public License.

References in zbMATH (referenced in 30 articles )

Showing results 1 to 20 of 30.
Sorted by year (citations)

1 2 next

  1. Guo, Ying-Jun; Lü, Xiao-Tao; Wen, Zhi-Xiong: On the boundary sequence of an automatic sequence (2022)
  2. Baranwal, Aseem; Schaeffer, Luke; Shallit, Jeffrey: Ostrowski-automatic sequences: theory and applications (2021)
  3. Currie, James D.; Mol, Lucas: The undirected repetition threshold and undirected pattern avoidance (2021)
  4. Gabric, Daniel; Shallit, Jeffrey: The simplest binary word with only three squares (2021)
  5. Kaplan, Craig S.; Shallit, Jeffrey: A frameless 2-coloring of the plane lattice (2021)
  6. Milosevic, Marko; Rampersad, Narad: Squarefree words with interior disposable factors (2021)
  7. Reed Oei, Dun Ma, Christian Schulz, Philipp Hieronymi: Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata (2021) arXiv
  8. Shallit, Jeffrey: Abelian complexity and synchronization (2021)
  9. Shallit, Jeffrey: Frobenius numbers and automatic sequences (2021)
  10. Shallit, Jeffrey: Say No to case analysis: automating the drudgery of case-based proofs (2021)
  11. Shallit, Jeffrey: Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking’s conjecture (2021)
  12. Bell, Jason; Lidbetter, Thomas F.; Shallit, Jeffrey: Additive number theory via approximation by regular languages (2020)
  13. Lejeune, Marie; Leroy, Julien; Rigo, Michel: Computing the (k)-binomial complexity of the Thue-Morse word (2020)
  14. Mol, Lucas; Rampersad, Narad: The weak circular repetition threshold over large alphabets (2020)
  15. Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey: Extremal overlap-free and extremal (\beta)-free binary words (2020)
  16. Rajasekaran, Aayush; Shallit, Jeffrey; Smith, Tim: Additive number theory via automata theory (2020)
  17. Rowland, Eric; Yassawi, Reem: Automaticity and invariant measures of linear cellular automata (2020)
  18. Baranwal, Aseem R.; Shallit, Jeffrey: Repetitions in infinite palindrome-rich words (2019)
  19. Baranwal, Aseem R.; Shallit, Jeffrey: Critical exponent of infinite balanced words via the Pell number system (2019)
  20. Currie, James; Harju, Tero; Ochem, Pascal; Rampersad, Narad: Some further results on squarefree arithmetic progressions in infinite words (2019)

1 2 next