Skip to Main content Skip to Navigation

A sound and complete axiomatization of the equational theory of Mealy machines.

Abstract : This small development in the Coq proof assistant introduces a term language and a basic equational theory for Mealy machines., i.e. finite-state letter-to-letter transducer. Soundness and completeness are proved for the equational theory.
Document type :
Software
Complete list of metadatas

Browse

Present sur SoftwareHeritage - Identifier : swh:1:dir:d26d7ad1514340934a5b546032e21ad2fcc87441;origin=https://hal.archives-ouvertes.fr/hal-02155786;visit=swh:1:snp:88a3a6cafdfd6d842ba0c086187015a1605f0cf0;anchor=swh:1:rev:dacff8b9c3574cd3fcb023c485209c72abd8efef;path=/  Browse

https://hal.inria.fr/hal-02155786
Contributor : Pierre Pradic <>
Submitted on : Thursday, June 13, 2019 - 8:26:26 PM
Last modification on : Monday, June 8, 2020 - 9:48:02 AM

Collections

Share

Metrics

Record views

69

Files downloads

488