The robust theory of regular languages is based on three important pillars: computation
(automata), logic, and algebra. In this paper, we survey old and recent results on extensions …

We derive well-understood and well-studied subregular classes of formal languages purely
from the computational perspective of algorithmic learning problems. We parameterise the …

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 …

This paper employs a computational framework to demonstrate that two competing feature-
geometric models of tonal representation are notationally equivalent. A model-theoretic …

In this paper we define quantifier-free least fixed point functions (QFLFP) and argue that they
are an appropriate and valuable approach to modeling phonological processes (construed …

Recent work has claimed that (non-tonal) phonological patterns are subregular (Heinz,,;
Heinz and Idsardi), occupying a delimited proper subregion of the regular functions—the …

We consider minimization problems for natural parameters of word transducers: the number
of passes performed by two-way transducers and the number of registers used by streaming …

The algebraic theory of rational languages has provided powerful decidability results.
Among them, one of the most fundamental is the definability of a rational language in the …

This article analyzes stem allomorphy in Serbo-Croatian neuter noun inflection as
morphological epenthesis. I demonstrate that consonant insertion in the inflection of Serbo …

Regular string-to-string functions enjoy a nice triple characterization through deterministic
two-way transducers (2DFT), streaming string transducers (SST) and MSO definable …