A Finite Axiomatisation of Finite-State Automata Using String Diagrams
Logic in Computer Science
2023-06-22 v3 Formal Languages and Automata Theory
Abstract
We 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. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.
Cite
@article{arxiv.2211.16484,
title = {A Finite Axiomatisation of Finite-State Automata Using String Diagrams},
author = {Robin Piedeleu and Fabio Zanasi},
journal= {arXiv preprint arXiv:2211.16484},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2009.14576