Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Jun 28, 2023 · We introduce symmetric monoidal automata, which define the class of regular symmetric monoidal languages.
Feb 7, 2024 · String Diagrammatic Trace Theory. Abstract: We extend the theory of formal languages in monoidal categories to the multi-sorted, symmetric case, ...
Sep 1, 2023 · Therefore, Mazurkewicz trace languages are symmetric monoidal languages over distributed alphabets.
In this paper, motivated by concurrency theory, we extend this theory to coloured props: multi-sorted monoidal categories with symmetries (Section 2). The ...
String Diagrammatic Trace Theory. from drops.dagstuhl.de
Aug 21, 2023 · Abstract. We extend the theory of formal languages in monoidal categories to the multi-sorted, symmetric case, and show how this theory permits ...
String Diagrammatic Trace Theory. from ncatlab.org
Oct 8, 2024 · String diagrams constitute a graphical calculus for expressing operations in monoidal categories.
Jul 4, 2024 · Matt Earnshaw and Pawel Sobocinski, String Diagrammatic Trace Theory, MFCS, 2023. [GF16]. Richard Garner and Ignacio López Franco ...
String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics and later formalised in the context of symmetric monoidal ...
String Diagrammatic Trace Theory. from qchu.wordpress.com
Nov 6, 2012 · String diagrams really prove their use when augmented to talk about duality, which will be described topologically by bending input and output wires.