[The University of Leicester]

Department of Mathematics & Computer Science



Next: Automatic Kan Extensions Up: Further work, questions Previous: Orderings on -sets

Language Theory

The actions in question are category actions on sets. Thus for each object of $ \mathsf{B}$ we wish to specify a set, and for each arrow of $ \mathsf{B}$ we require a function defined on the sets. In theory it is fine to specify sets by equivalence classes of a larger set, with a normal form function. In practice we may wish to get hold of an expression for all the normal forms. When the sets are finite we can use a basic enumeration procedure, but when the sets are infinite, enumeration is not an answer. In this case an automaton can be constructed from the complete rewrite system and language equations can be obtained and manipulated to obtain a regular expression for the normal forms of the elements of each set. It would be nice to program this!

Next: Automatic Kan Extensions Up: Further work, questions Previous: Orderings on -sets

[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.