Simulating finite Eilenberg machines with a reactive engine

DOI10.1016/J.ENTCS.2011.02.019MaRDI QIDQ5166624zbMATH OpenOpenAlexWikidataFDO

Authors Benoît Razet

Publication date 27 June 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2011.02.019

zbMATH Keywords

automataCoqEilenberg machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Finite Eilenberg Machines
• Computing with relational machines
• A constructive theory of regular languages in Coq
• The Reactive Engine for Modular Transducers
• A mechanisation of some context-free language theory in HOL4

Cites work

• A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
• Finite Eilenberg Machines
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Proving termination with multiset orderings
• Subset Coercions in Coq
• The Reactive Engine for Modular Transducers

Cited in

(3)

• Finite Eilenberg Machines
• Computing with relational machines
• The Reactive Engine for Modular Transducers

Describes a project that uses

Uses Software

• Coq
• OCaml

This page was built for publication: Simulating finite Eilenberg machines with a reactive engine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166624)