Regular Monoidal Languages
Formal Languages and Automata Theory
2022-07-04 v1 Category Theory
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.
Cite
@article{arxiv.2207.00526,
title = {Regular Monoidal Languages},
author = {Matthew Earnshaw and Paweł Sobociński},
journal= {arXiv preprint arXiv:2207.00526},
year = {2022}
}
Comments
Full version of a paper accepted for MFCS 2022