Automata Mista

摘要

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.