Simulating Finite Eilenberg Machines with a Reactive Engine

DOI10.1016/j.entcs.2011.02.019zbMath1291.68232OpenAlexW2076881600WikidataQ113318281 ScholiaQ113318281MaRDI QIDQ5166624

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)

Related Items

Computing with relational machines

Uses Software

• Coq
• OCaml

Cites Work

• Unnamed Item
• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
• Finite Eilenberg Machines
• Subset Coercions in Coq
• Proving termination with multiset orderings
• The Reactive Engine for Modular Transducers