Carregant...
A String Diagrammatic Axiomatisation of Finite-State Automata
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 not...
Guardat en:
| Publicat a: | Foundations of Software Science and Computation Structures |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2021
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7984119/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-71995-1_24 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|