1999/03/05 by Ronald Brown, Brown, Ronald, Anne Heyworth +1
Computer Science · Mathematics · #68Q42 18A40 68Q40 #Combinatorics (math.CO) #FOS: Mathematics #Logic, programming, and type systems #Natural Language Processing Techniques #math.CO #msc:18A40 #msc:68Q40 #msc:68Q42 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/9903032
31 pages, LaTeX2e, (submitted to JSC)
arxiv created 1999/03/05 · openalex publication_date 1999/03/05 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. This is related to work of Carmody-Walters on the Todd-Coxeter procedure for Kan extensions, but allows for the output data to be infinite, described by a language. The result also allows rewrite methods to be applied in a greater range of situations and examples, in terms of induced actions of monoids, categories, groups or groupoids.