Regular monoidal languages

DOI10.4230/LIPICS.MFCS.2022.44MaRDI QIDQ6584041zbMATH OpenFDO

Authors Matthew Earnshaw, Paweł Sobociński

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.44

zbMATH Keywords

cartesian restriction categoriesformal language theorymonoidal categoriesstring diagrams

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• Regular planar monoidal languages
• The produoidal algebra of process decomposition
• Context-free languages of string diagrams
• \textit{Grappa RE} -- a tool for efficient graph recognition based on finite automata and regular expressions
• The categorical contours of the Chomsky-Schützenberger representation theorem

This page was built for publication: Regular monoidal languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584041)