ContextFree Languages of String Diagrams
Abstract
We introduce contextfree languages of morphisms in monoidal categories, extending recent work on the categorification of contextfree languages, and regular languages of string diagrams. Contextfree languages of string diagrams include classical contextfree languages of words, trees, and hypergraphs, when instantiated over appropriate monoidal categories. Using a contoursplicing adjunction, we prove a representation theorem for contextfree languages of string diagrams: every such language arises as the image under a monoidal functor of a regular language of string diagrams.
 Publication:

arXiv eprints
 Pub Date:
 April 2024
 DOI:
 10.48550/arXiv.2404.10653
 arXiv:
 arXiv:2404.10653
 Bibcode:
 2024arXiv240410653E
 Keywords:

 Computer Science  Formal Languages and Automata Theory;
 Mathematics  Category Theory