Skip to main content
Journal Article

Automata mista

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2772 359-372
DOI: 10.1007/978-3-540-39910-0_17
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Huet, G. (2004). Automata mista. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 359–372. https://doi.org/10.1007/978-3-540-39910-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free