Using Automata to obtain Regular Expressions for Induced Actions

Simple item page
dc.creatorHeyworth, Anne
dc.date1999-06-23
dc.date.accessioned2026-07-07T05:29:37Z
dc.date.available2026-07-07T05:29:37Z
dc.descriptionPresentations 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.
dc.description14 pages, LaTeX2e, (submitted to IJAC)
dc.identifierhttps://arxiv.org/abs/math/9906153
dc.identifierhttp://arxiv.org/abs/math/9906153
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78706
dc.subjectCombinatorics
dc.subject08A50 16B50 68Q40 68Q42 68Q45
dc.titleUsing Automata to obtain Regular Expressions for Induced Actions
dc.typetext

Files

Collections

arXiv