arXiv Open Access 2024

Context-Free Languages of String Diagrams

Matt Earnshaw Mario Román

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL math.CT

Penulis (2)

Matt Earnshaw

Mario Román

Format Sitasi

APA MLA BibTeX

Earnshaw, M., Román, M. (2024). Context-Free Languages of String Diagrams. https://arxiv.org/abs/2404.10653

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓