Using Automata to obtain Regular Expressions for Induced Actions

arXivmath/9906153MaRDI QIDQ6501375FDOQ6501375

Abstract: 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.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Word problems (aspects of algebraic structures) (08A50) Category-theoretic methods and results in associative algebras (except as in 16D90) (16B50)

This page was built for publication: Using Automata to obtain Regular Expressions for Induced Actions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501375)