Finite Eilenberg Machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Finite Eilenberg Machines

Benoit Razet
  • Function : Author
  • PersonId : 833443


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 restriction ensures a correct behavior of the simulation. Interpretations of this restriction are studied for the particular cases of non-deterministic automata (NFA) and rational 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.
Fichier principal
Vignette du fichier
fem.pdf (248.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00257354 , version 1 (25-02-2008)
inria-00257354 , version 2 (03-04-2008)
inria-00257354 , version 3 (04-04-2008)


  • HAL Id : inria-00257354 , version 3


Benoit Razet. Finite Eilenberg Machines. [Research Report] INRIA. 2008. ⟨inria-00257354v3⟩
66 View
159 Download


Gmail Facebook Twitter LinkedIn More