The Walnut Tutorial: Using A Tool for Doing Combinatorics on Words
Jeffrey Shallit
Abstract: Walnut is free open-source software, written by Hamoon Mousavi, that can rigorously prove or disprove claims about automatic sequences (broadly understood), such as the Thue-Morse sequence, the Fibonacci infinite word, and others. It can also be used to create explicit formulas for various aspects of such sequences, such as subword complexity, palindrome complexity, and so forth.
In this talk I won't discuss how it works. Instead I'll give a tutorial, surveying the kinds of things you can and can't do with it. We'll "get our hands dirty" and solve problems in real time.
At the end, if there's time, I'll solicit problems about such sequences from the audience and try to solve them with Walnut. Come prepared with some conjecture you haven't been able to prove yet!
The tutorial will last about 90 minutes.
formal languages and automata theorycombinatoricsdynamical systems
Audience: researchers in the topic
One World Combinatorics on Words Seminar
Series comments: Please write to Anna Frid to receive the Zoom password and further announcements.
| Organizers: | Anna Frid*, Narad Rampersad, Jeffrey Shallit*, Manon Stipulanti |
| *contact for this listing |