A Finite Axiomatisation of Finite-State Automata Using String Diagrams
From MaRDI portal
Publication:5883739
DOI10.46298/lmcs-19(1:13)2023OpenAlexW4320913831MaRDI QIDQ5883739
Publication date: 22 March 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.16484v3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The calculus of signal flow diagrams. I: Linear relations on streams.
- Cartesian bicategories. I
- Coherence for compact closed categories
- Complete systems of \(\mathcal B\)-rational identities
- A completeness theorem for Kleene algebras and the algebra of regular events
- Glueing and orthogonality for models of linear logic
- Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
- A string diagrammatic axiomatisation of finite-state automata
- Causal inference by string diagram surgery
- Concurrent Kleene algebra: free model and completeness
- Matrix and matricial iteration theories. I
- Matrix and matricial iteration theories. II
- The programming language Pascal
- Connector algebras for C/E and P/T nets' interactions
- Picturing Quantum Processes
- A Survey of Graphical Languages for Monoidal Categories
- Concurrent Kleene Algebra
- Equational axioms for regular sets
- A Compositional Framework for Passive Linear Networks
- Props in Network Theory
- Traced monoidal categories
- Graphical Conjunctive Queries.
- An Invitation to Applied Category Theory
- NetKAT
- Programming Techniques: Regular expression search algorithm
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- A logical calculus of the ideas immanent in nervous activity
This page was built for publication: A Finite Axiomatisation of Finite-State Automata Using String Diagrams
