A Finite Axiomatisation of Finite-State Automata Using String Diagrams

DOI10.46298/LMCS-19(1:13)2023MaRDI QIDQ5883739zbMATH OpenOpenAlexFDO

Authors Robin Piedeleu, Fabio Zanasi

Publication date 22 March 2023

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

finite-state automatasymmetric monoidal categorycomplete axiomatisationstring diagrams

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Equational reasoning with context-free families of string diagrams
• A framework for rewriting families of string diagrams
• scientific article; zbMATH DE number 139630
• String diagram rewrite theory. I: Rewriting with Frobenius structure
• A categorical framework for finite state machines

Cites work

• 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 549971 (Why is no real title available?)
• scientific article; zbMATH DE number 1033559 (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 3316966 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• A Compositional Framework for Passive Linear Networks
• A completeness theorem for Kleene algebras and the algebra of regular events
• 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
• Cartesian bicategories. I
• 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
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Glueing and orthogonality for models of linear logic
• Graphical Conjunctive Queries.
• Matrix and matricial iteration theories. I
• 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
• Props in Network Theory
• 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

(3)

• Implementation and Application of Automata
• A diagrammatic algebra for program logics
• Automata Presenting Structures: A Survey of the Finite String Case

Describes a project that uses

Uses Software

• NetKAT

This page was built for publication: A Finite Axiomatisation of Finite-State Automata Using String Diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883739)