Current browse context:
cs.FL
Change to browse by:
References & Citations
Computer Science > Formal Languages and Automata Theory
Title: Context-Free Languages of String Diagrams
(Submitted on 16 Apr 2024)
Abstract: We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include classical context-free languages of words, trees, and hypergraphs, when instantiated over appropriate monoidal categories. Using a contour-splicing adjunction, we prove a representation theorem for context-free languages of string diagrams: every such language arises as the image under a monoidal functor of a regular language of string diagrams.
Link back to: arXiv, form interface, contact.