Master’s Thesis Presentation • Algorithms and Complexity — Decision Algorithms for Ostrowski-Automatic Sequences

Please note: This master’s thesis presentation will be given online.

Aseem Baranwal, Master’s candidate
David R. Cheriton School of Computer Science

We extend the notion of automatic sequences to Ostrowski-automatic sequences. Our primary contributions include a decision procedure for computationally deciding certain combinatorial and enumeration questions about these sequences, partial resolution of a conjecture on balanced words, and several new results pertaining to rich words, Lucas words, and antisquare avoidance. We also provide an implementation of these procedures as part of the software package Walnut.

To join this master’s theis presentation on Zoom, please go to https://zoom.us/j/95787909721.