2026-07-22T22:18:01Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:22784 2025-02-03T10:18:31Z ddc:004 open_access

A Complete Diagrammatic Calculus for Automata Simulation Antoine, Thibaut Piedeleu, Robin Silva, Alexandra Zanasi, Fabio finite-state automata simulation string diagrams axiomatisation We give a sound and complete (in)equational theory for simulation of finite state automata. Our approach uses a string diagrammatic calculus to represent automata and a functorial semantics to capture simulation in a compositional way. Interestingly, in contrast to other approaches based on regular expressions, fixpoints are a derived notion in our calculus and the resulting axiomatisation is finitary. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Thibaut Antoine and Robin Piedeleu and Alexandra Silva and Fabio Zanasi 2025 Is Part Of LIPIcs, Volume 326, 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2025.27 urn:nbn:de:0030-drops-227848 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.27 eng https://creativecommons.org/licenses/by/4.0/legalcode