A string diagrammatic axiomatisation of finite-state automata
From MaRDI portal
Publication:2233427
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- A Compositional Framework for Passive Linear Networks
- A logical calculus of the ideas immanent in nervous activity
- A string diagrammatic axiomatisation of finite-state automata
- A survey of graphical languages for monoidal categories
- An Invitation to Applied Category Theory
- Causal inference by string diagram surgery
- Coherence for compact closed categories
- Complete systems of \(\mathcal B\)-rational identities
- Concurrent Kleene Algebra
- Concurrent Kleene algebra: free model and completeness
- Connector algebras for C/E and P/T nets' interactions
- Equational axioms for regular sets
- Glueing and orthogonality for models of linear logic
- scientific article; zbMATH DE number 2185716 (Why is no real title available?)
- scientific article; zbMATH DE number 2125662 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 193320 (Why is no real title available?)
- scientific article; zbMATH DE number 475236 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1482700 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (Why is no real title available?)
- scientific article; zbMATH DE number 3316966 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Matrix and matricial iteration theories. II
- Netkat, semantic foundations for networks
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- Programming Techniques: Regular expression search algorithm
- Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
- The calculus of signal flow diagrams. I: Linear relations on streams.
- The programming language Pascal
- Traced monoidal categories
Cited in
(14)- A string diagrammatic axiomatisation of finite-state automata
- Automata Presenting Structures: A Survey of the Finite String Case
- Implementation and Application of Automata
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams
- A String Diagrammatic Axiomatisation of Finite-State Automata
- A compositional approach to parity games
- A complete diagrammatic calculus for Boolean satisfiability
- Rewriting modulo traced comonoid structure
- A graphical \#SAT algorithm for formulae with small clause density
- Diagrammatic algebra of first order logic
- When Lawvere meets Peirce: an equational presentation of Boolean hyperdoctrines
- Compositional separation of control flow and data flow
- The calculus of neo-Peircean relations
- On Boolean hyperdoctrines and peircean bicategories
This page was built for publication: A string diagrammatic axiomatisation of finite-state automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233427)
