## Automata Mista (2003)

### Cached

### Download Links

- [pauillac.inria.fr]
- [yquem.inria.fr]
- [pauillac.inria.fr]
- DBLP

### Other Repositories/Bibliography

Venue: | Zohar Manna on the Occasion of His 64th Birthday |

Citations: | 5 - 4 self |

### BibTeX

@INPROCEEDINGS{Huet03automatamista,

author = {Gérard Huet},

title = {Automata Mista},

booktitle = {Zohar Manna on the Occasion of His 64th Birthday},

year = {2003},

pages = {359--372}

}

### OpenURL

### Abstract

Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as finite-state process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of Objective Caml. 1

### Citations

3836 |
J.D.: Introduction to automata theory, languages, and computation
- Hopcroft, Motwani, et al.
(Show Context)
Citation Context ... Pidgin ML, a core applicative subset of Objective Caml. 1 Introduction Dedicated to Zohar Manna for his 2 6 th birthday We assume well-known the theory of finite-state machines, as presented in e.g. =-=[11, 1, 5, 4]-=-. Constructions of such machines, defined by compiling regular relations or other compositional formalism, typically alternate descriptions of deterministic automata and non-deterministic ones, using ... |

320 |
Introduction to Formal Language Theory
- Harrison
- 1978
(Show Context)
Citation Context ... Pidgin ML, a core applicative subset of Objective Caml. 1 Introduction Dedicated to Zohar Manna for his 2 6 th birthday We assume well-known the theory of finite-state machines, as presented in e.g. =-=[11, 1, 5, 4]-=-. Constructions of such machines, defined by compiling regular relations or other compositional formalism, typically alternate descriptions of deterministic automata and non-deterministic ones, using ... |

198 |
Z.: Proving termination with multiset orderings
- Dershowitz, Manna
- 1979
(Show Context)
Citation Context ...ch generate all possible transductions by resumption coroutines.sII We give a termination argument for an important subclass of such finite machines, which uses the Dershowitz-Manna multiset ordering =-=[3]-=- in a natural way, and which is invariant by choice selection, allowing arbitrary selection tactics such as preference by weights obtained by training on annotated samples or other stochastic automata... |

92 | Reutenauer: Codes and Automata
- Berstel, Perrin, et al.
(Show Context)
Citation Context ... Pidgin ML, a core applicative subset of Objective Caml. 1 Introduction Dedicated to Zohar Manna for his 2 6 th birthday We assume well-known the theory of finite-state machines, as presented in e.g. =-=[11, 1, 5, 4]-=-. Constructions of such machines, defined by compiling regular relations or other compositional formalism, typically alternate descriptions of deterministic automata and non-deterministic ones, using ... |

68 |
The Objective Caml system: Documentation and user’s manual. 3.07 edn. INRIA
- Leroy, Doligez, et al.
- 2003
(Show Context)
Citation Context ...ained by training on annotated samples or other stochastic automata descriptions. All our constructions use the algorithmic description language Pidgin ML, a core applicative subset of Objective Caml =-=[10, 2]-=-. A useful reference for the basic datatypes and algorithms is our description of the Zen toolkit [7, 9, 8]. 2 Finite-state Machines 2.1 Simplistic Automata We use as alphabet the natural numbers prov... |

55 | Finite-State Language Processing - Roche, Schabes - 1997 |

48 |
A Functional Approach to Programming
- Cousineau, Mauny
- 1998
(Show Context)
Citation Context ...ained by training on annotated samples or other stochastic automata descriptions. All our constructions use the algorithmic description language Pidgin ML, a core applicative subset of Objective Caml =-=[10, 2]-=-. A useful reference for the basic datatypes and algorithms is our description of the Zen toolkit [7, 9, 8]. 2 Finite-state Machines 2.1 Simplistic Automata We use as alphabet the natural numbers prov... |

15 |
Transducers as lexicon morphisms, phonemic segmentation by euphony analysis, application to a sanskrit tagger, in "Journal of Functional Programming
- HUET
(Show Context)
Citation Context ...ages. 2.2 Minimal Simplistic Automata Proposition 1. Every simplistic automaton admits a unique equivalent minimal simplistic automaton. Proof. Share the lexical tree as a dag, using the Share functor=-=[6, 8]-=-. Remark 2. The minimal simplistic automaton recognizing a given language represents the minimal deterministic finite-state automaton which recognizes its language. We leave the proof of this simple f... |

13 | contexts and the sharing functor: Techniques for symbolic computation
- Linear
- 2003
(Show Context)
Citation Context ...se the algorithmic description language Pidgin ML, a core applicative subset of Objective Caml [10, 2]. A useful reference for the basic datatypes and algorithms is our description of the Zen toolkit =-=[7, 9, 8]-=-. 2 Finite-state Machines 2.1 Simplistic Automata We use as alphabet the natural numbers provided by the hardware processor: type l e t t e r = i n t and word = l i s t l e t t e r ; Simplistic automa... |

11 | Zen and the art of symbolic computing: Light and fast applicative algorithms for computational linguistics
- Huet
- 2003
(Show Context)
Citation Context ...se the algorithmic description language Pidgin ML, a core applicative subset of Objective Caml [10, 2]. A useful reference for the basic datatypes and algorithms is our description of the Zen toolkit =-=[7, 9, 8]-=-. 2 Finite-state Machines 2.1 Simplistic Automata We use as alphabet the natural numbers provided by the hardware processor: type l e t t e r = i n t and word = l i s t l e t t e r ; Simplistic automa... |

10 | The Zen computational linguistics toolkit - Huet - 2002 |