1 citations · 1 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2024★ 1 cited
Context-Free Languages of String Diagrams
Matt Earnshaw, Mario Román
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 di…
cs.FL2022
Regular Monoidal Languages
Matthew Earnshaw, Paweł Sobociński
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 wor…