A string diagrammatic axiomatisation of finite-state automata

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

Authors: Robin Piedeleu, Fabio Zanasi 

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 software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Netkat, semantic foundations for networks
• A survey of graphical languages for monoidal categories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equational axioms for regular sets
• A logical calculus of the ideas immanent in nervous activity
• Traced monoidal categories
• Title not available (Why is that?)
• Complete systems of \(\mathcal B\)-rational identities
• A completeness theorem for Kleene algebras and the algebra of regular events
• Concurrent Kleene Algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coherence for compact closed categories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Glueing and orthogonality for models of linear logic
• Programming Techniques: Regular expression search algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Connector algebras for C/E and P/T nets' interactions
• Title not available (Why is that?)
• A Compositional Framework for Passive Linear Networks
• The programming language Pascal
• The calculus of signal flow diagrams. I: Linear relations on streams.
• An Invitation to Applied Category Theory
• Matrix and matricial iteration theories. II
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Concurrent Kleene algebra: free model and completeness
• Causal inference by string diagram surgery
• Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
• A string diagrammatic axiomatisation of finite-state automata

Cited In (6)

• A String Diagrammatic Axiomatisation of Finite-State Automata
• A string diagrammatic axiomatisation of finite-state automata
• Implementation and Application of Automata
• Automata Presenting Structures: A Survey of the Finite String Case
• A Finite Axiomatisation of Finite-State Automata Using String Diagrams
• A compositional approach to parity games

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)