Author:
Piedeleu Robin,Zanasi Fabio
Abstract
AbstractWe develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite— a result which is provably impossible for the one-dimensional syntax of regular expressions. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.
Publisher
Springer International Publishing
Reference42 articles.
1. Anderson, C.J., Foster, N., Guha, A., Jeannin, J.B., Kozen, D., Schlesinger, C., Walker, D.: Netkat: semantic foundations for networks. ACM SIGPLAN Notices 49(1), 113–126 (2014)
2. Arden, D.N.: Delayed-logic and finite-state machines. In: 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961). pp. 133–151. IEEE (1961)
3. Baez, J.C., Fong, B.: A compositional framework for passive linear networks. Theory & Applications of Categories 33 (2018)
4. Bloom, S.L., Ésik, Z.: Equational axioms for regular sets. Mathematical structures in computer science 3(1), 1–24 (1993)
5. Bloom, S.L., Ésik, Z.: Iteration theories. Springer (1993)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Graphical #SAT Algorithm for Formulae with Small Clause Density;Electronic Proceedings in Theoretical Computer Science;2024-08-12
2. Diagrammatic Algebra of First Order Logic;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Axiomatization of Blockchain Theory;Mathematics;2023-07-03
4. A Finite Axiomatisation of Finite-State Automata Using String Diagrams;Logical Methods in Computer Science;2023-02-15
5. Deconstructing the Calculus of Relations with Tape Diagrams;Proceedings of the ACM on Programming Languages;2023-01-09