Finite Eilenberg Machines

Authors:
Benoît Razet
Affiliations:
INRIA Paris-Rocquencourt, Aden,
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 5
Cited 1

Proving termination with multiset orderings

Communications of the ACM
Automata, Languages, and Machines

Automata, Languages, and Machines
Finite-State Language Processing

Finite-State Language Processing
A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger

Journal of Functional Programming
A unified construction of the glushkov, follow, and antimirov automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Simulating Finite Eilenberg Machines with a Reactive Engine

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Eilenberg machines define a general computational model. They are well suited to the simulation of problems specified using finite state formalisms such as formal languages and automata theory. This paper introduces a subclass of them called finite Eilenberg machines. We give a formal description of complete and efficient algorithms which permit the simulation of such machines. We show that our finiteness condition ensures a correct behavior of the simulation. Interpretations of this condition are studied for the cases of non-deterministic finite automata (NFA) and transducers, leading to applications to computational linguistics. The given implementation provides a generic simulation procedure for any problem encoded as a composition of finite Eilenberg machines.