[The University of Leicester]

Department of Mathematics & Computer Science



Next: Bibliography Up: Further work, questions Previous: Language Theory

Automatic Kan Extensions

Given the existing and current work on automatic groups, semigroups and coset systems it is natural to ask: what does the concept of automatic mean in terms of a Kan extension? An automatic coset system consists of ``a finite state automaton that provides a name for each coset, and a set of finite state automata that allow these cosets to be multiplied by the group generators'' [15]. We would expect therefore that an automatic Kan extension system would consist of a finite state automata for each set $ KB$ that provides a name for each element of the set, and a finite state automaton for each arrow on $ \Delta$ that allows the sets to be acted upon by the arrows of $ \mathsf{B}$.



[University Home] [MCS Home] [University Index A-Z] [University Search] [University Help]

Author: A. Heyworth, tel: +44 (0)116 252 3884
Last updated: 2000-11-24
MCS Web Maintainer
This document has been approved by the Head of Department.
© University of Leicester.