A string diagrammatic axiomatisation of finite-state automata

DOI10.1007/978-3-030-71995-1_24OpenAlexW3146630147MaRDI QIDQ2233427

Fabio Zanasi, Robin Piedeleu

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2009.14576

zbMATH Keywords

finite-state automatasymmetric monoidal categorycomplete axiomatisationstring diagrams

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ A string diagrammatic axiomatisation of finite-state automata

Cites Work

• The calculus of signal flow diagrams. I: Linear relations on streams.
• 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. 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
• Traced monoidal categories
• An Invitation to Applied Category Theory
• NetKAT
• Programming Techniques: Regular expression search algorithm
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A string diagrammatic axiomatisation of finite-state automata