Mathematics – Combinatorics
Scientific paper
1999-06-23
Mathematics
Combinatorics
14 pages, LaTeX2e, (submitted to IJAC)
Scientific paper
Presentations of Kan extensions of category actions provide a natural framework for expressing induced actions, and therefore a range of different combinatorial problems. Rewrite systems for Kan extensions have been defined and a variation on the Knuth-Bendix completion procedure can be used to complete them -- when possible. Regular languages and automata are a useful way of expressing sets and actions, and in this paper we explain how to use rewrite systems for Kan extensions to construct automata expressing the induced action and how sets of normal forms can be calculated by obtaining language equations from the automata.
No associations
LandOfFree
Using Automata to obtain Regular Expressions for Induced Actions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Using Automata to obtain Regular Expressions for Induced Actions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Automata to obtain Regular Expressions for Induced Actions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-28952