M-Sets and Automata

Abstract

<p>This thesis attempts to provide a more algebraic foundation for the study of automata. Specifically, a category containing the category of finite state semiautomata is investigated. It is shown that the push down automata of Ginsburg can be treated in a way consistent with a categorical program, and a new characterization of context-free languages is thus obtained.</p>