×

zbMATH — the first resource for mathematics

Finite categories and regular languages. (English) Zbl 0761.68065
Mathematical problems in computation theory, Proc. 26th semester, Warsaw/Poland 1985, Banach Cent. Publ. 21, 395-402 (1988).
Summary: [For the entire collection see Zbl 0745.00057.]
The traditional approach in algebraic theory of automata is to represent finite-state machines as finite monoids. Several recent results have been obtained by considering categories instead of monoids. We argue that this generalization is very natural, that it preserves many important classical results, and that it allows new methods for solving old problems.

MSC:
68Q70 Algebraic theory of languages and automata
68Q45 Formal languages and automata
18B20 Categories of machines, automata
PDF BibTeX XML Cite