Using Automata to obtain Regular Expressions for Induced Actions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, LaTeX2e, (submitted to IJAC)

Keywords

Combinatorics, 08A50 16B50 68Q40 68Q42 68Q45

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/78706

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9906153
 http://arxiv.org/abs/math/9906153

Collections

arXiv