Regular Monoidal Languages
From MaRDI portal
Publication:6403763
arXiv2207.00526MaRDI QIDQ6403763FDOQ6403763
Authors: Matthew Earnshaw, Paweł Sobociński 
Publication date: 1 July 2022
Abstract: We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of languages over string diagrams. We use the algebra of monoidal and cartesian restriction categories to investigate the properties of regular monoidal languages, and provide sufficient conditions for their recognizability by deterministic monoidal automata.
This page was built for publication: Regular Monoidal Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6403763)
