Context-free languages of string diagrams
From MaRDI portal
Cites work
- A Kleene theorem for a class of planar acyclic graphs
- A note on context-free languages
- A survey of graphical languages for monoidal categories
- Automata in general algebras
- Categorical quantum mechanics
- Categories as algebra: An essential ingredient in the theory of monoids
- Context-free grammars on trees
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graphical affine algebra
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 2134022 (Why is no real title available?)
- scientific article; zbMATH DE number 2028929 (Why is no real title available?)
- scientific article; zbMATH DE number 7350772 (Why is no real title available?)
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 2222245 (Why is no real title available?)
- Hyperedge replacement: grammars and languages
- Hypergraph categories
- Monadic monadic second order logic
- Monoidal Width
- On multiple context-free grammars
- Open diagrams via coend calculus
- Recognizable languages of arrows and cospans
- Regular monoidal languages
- Regular planar monoidal languages
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- String diagrammatic trace theory
- The geometry of tensor calculus. I
- The produoidal algebra of process decomposition
- Varieties of Languages in a Category
- Wiring diagrams as normal forms for computing in symmetric monoidal categories
This page was built for publication: Context-free languages of string diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889899)
