LIPIcs.CSL.2025.27.pdf
- Filesize: 0.87 MB
- 22 pages
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.
Feedback for Dagstuhl Publishing