Using rewriting systems to compute left Kan extensions and induced actions of categories

DOI10.1006/jsco.1999.0294zbMath0941.18005arXivmath/9903032OpenAlexW2106329988MaRDI QIDQ1971490

Anne Heyworth, Ronald Brown

Publication date: 3 August 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9903032

zbMATH Keywords

left Kan extensionsstring-rewritinginduced actionsTodd-Coxeter procedure

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Grammars and rewriting systems (68Q42) Software, source code, etc. for problems pertaining to category theory (18-04)

Related Items

Automatic semigroups and categories., String rewriting for double coset systems., Computing over K-modules

Cites Work

• Computing automatic coset systems and subgroup presentations
• Computing left Kan extensions.
• Rings with several objects
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item