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.

[1]  Jeffrey Shallit,et al.  Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties , 2016, Int. J. Found. Comput. Sci..

[2]  Alfred J. van der Poorten,et al.  Automatic sequences. Theory, applications, generalizations , 2005, Math. Comput..

[3]  Jeffrey Shallit,et al.  Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences , 2016, Electron. J. Comb..

[4]  Luke Schaeffer,et al.  Deciding Properties of Automatic Sequences , 2013 .

[5]  Jeffrey Shallit,et al.  Decidability and Enumeration for Automatic Sequences: A Survey , 2013, CSR.

[6]  Jeffrey Shallit,et al.  A New Approach to the Paperfolding Sequences , 2015, CiE.

[7]  Jeffrey Shallit,et al.  Mechanical Proofs of Properties of the Tribonacci Word , 2014, WORDS.

[8]  Daniel Goč.  Automatic Sequences and Decidable Properties: Implementation and Applications , 2013 .

[9]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[10]  Jeffrey Shallit,et al.  Closed, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences , 2015, ArXiv.

[11]  Jeffrey Shallit,et al.  Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability , 2017, Theor. Comput. Sci..

[12]  Jeffrey Shallit,et al.  Decision algorithms for Fibonacci-automatic Words, I: Basic results , 2016, RAIRO Theor. Informatics Appl..

[13]  Jeffrey Shallit,et al.  Enumeration and Decidable Properties of Automatic Sequences , 2011, Developments in Language Theory.