Deciding Properties of Automatic Sequences
In this thesis, we show that several natural questions about automatic sequences can be expressed as logical predicates and then decided mechanically. We extend known results in this area to broader classes of sequences (e.g., paperfolding words), introduce new operations that extend the space of po...
Main Author: | |
---|---|
Language: | en |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/7899 |