Regular planar monoidal languages
From MaRDI portal
Publication:6561334
DOI10.1016/J.JLAMP.2024.100963MaRDI QIDQ6561334FDOQ6561334
Authors: Matthew Earnshaw, Paweł Sobociński 
Publication date: 25 June 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Title not available (Why is that?)
- The geometry of tensor calculus. I
- A survey of graphical languages for monoidal categories
- Graph structure and monadic second-order logic. A language-theoretic approach
- Title not available (Why is that?)
- Premonoidal categories and notions of computation
- Quantaloids, enriched categories and automata theory
- Categorical algebra
- Restriction categories. I: Categories of partial maps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- A note on context-free languages
- Higher-dimensional word problems with applications to equational logic
- Restriction categories III: colimits, partial limits and extensivity
- A Kleene theorem for a class of planar acyclic graphs
- Automata in general algebras
- Languages of higher-dimensional automata
- Title not available (Why is that?)
- Regular languages of words over countable linear orderings
- Petri nets based on Lawvere theories
- Eilenberg Theorems for Free
- Shapely monads and analytic functors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular monoidal languages
This page was built for publication: Regular planar monoidal languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561334)
