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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. S. Alfred V. Aho and J. D. Ullman. Compilers — Principles, Techniques and Tool s. Addison-Wesley, 1986.
G. Cousineau and M. Mauny. The Functional Approach to Programming. Cambridge University Press, 1998.
N. Dershowitz and Z. Manna. Proving termination with multiset ordering. Commun. ACM, 22:465–476, 1979.
M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
G. Huet. Transducers as lexicon morphisms, phonemic segmentation by euphony analysis, application to a sanskrit tagger. http://pauillac.inria.fr/~huet/FREE/tagger.pdf, 2002.
G. Huet. The Zen computational linguistics toolkit. Technical report, ESSLLI Course Notes, 2002. http://pauillac.inria.fr/~huet/ZEN/zen.pdf
G. Huet. Linear contexts and the sharing functor: Techniques for symbolic computation. In F. Kamareddine, editor, Thirty Five Years of Automating Mathematics. Kluwer, 2003.
G. Huet. Zen and the art of symbolic computing: Light and fast applicative algorithms for computational linguistics. In Practical Aspects of Declarative Languages (PADL) symposium, New Orleans. LNCS 2562, Springer-Verlag, 2003.
X. Leroy, D. Rémy, J. Vouillon, and D. Doligez. The Objective Caml system, documentation and user’s manual — release 3.00. INRIA, 2000. http://caml.inria.fr/ocaml/
D. Perrin. Finite automata. In Formal Models and Semantics. Handbook of Theoretical Computer Science, Volume B. Elsevier and MIT Press, 1990. [12] E. Roche and Y. Schabes. Finite-State Language Processing. MIT Press, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Huet, G. (2003). Automata Mista. In: Dershowitz, N. (eds) Verification: Theory and Practice. Lecture Notes in Computer Science, vol 2772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39910-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-39910-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21002-3
Online ISBN: 978-3-540-39910-0
eBook Packages: Springer Book Archive