Answers are grounded in this paper and cite their sources.
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 of these pillars to functions from words to words. We consider two important classes of word functions, the rational and regular functions, respectively defined by one-way and two-way automata with output words, called transducers.
No takes yet. Share an insight, caveat, or question.
Filiot et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: