License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.44
URN: urn:nbn:de:0030-drops-168425
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16842/
Earnshaw, Matthew ;
Sobociński, Paweł
Regular Monoidal Languages
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 categories to investigate the properties of regular monoidal languages, and provide sufficient conditions for their recognizability by deterministic monoidal automata.
BibTeX - Entry
@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2022.44,
author = {Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}},
title = {{Regular Monoidal Languages}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16842},
URN = {urn:nbn:de:0030-drops-168425},
doi = {10.4230/LIPIcs.MFCS.2022.44},
annote = {Keywords: monoidal categories, string diagrams, formal language theory, cartesian restriction categories}
}
Keywords: |
|
monoidal categories, string diagrams, formal language theory, cartesian restriction categories |
Collection: |
|
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) |
Issue Date: |
|
2022 |
Date of publication: |
|
22.08.2022 |