Skip to Main content Skip to Navigation
Reports

Finite Eilenberg Machines

Benoit Razet 1
1 SANSKRIT - Sanskrit Computational Linguistics
Inria Paris-Rocquencourt, Université d'Hyderabad
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 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.
Document type :
Reports
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/inria-00257354
Contributor : Benoit Razet <>
Submitted on : Friday, April 4, 2008 - 9:40:11 AM
Last modification on : Thursday, March 5, 2020 - 4:54:59 PM
Long-term archiving on: : Monday, October 22, 2012 - 12:55:50 PM

Files

fem.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00257354, version 3

Collections

Citation

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

Share

Metrics

Record views

148

Files downloads

282