Boolean monadic recursive schemes as a logical characterization of subsequential functions


This paper defines boolean monadic recursive schemes (BMRSs), a restriction on recursive programs, and shows that when interpreted as transductions on strings they describe exactly the subsequential functions. We discuss how this new result furthers the study of the connections between logic, formal languages and functions, and automata.

LATA 2020
Chris Oakden
Chris Oakden
PhD Candidate

My research interests include phonological representation, Chinese tone sandhi, and process interactions