Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa - Non-deterministic Turing machine - Document - PDFSEARCH.IO

First Page	Meta Content
	Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa Add to Reading List Document Date: 2008-12-14 19:37:35 Open Document File Size: 249,44 KB Share Result on Facebook Company Oracle / / Facility Zen library / / IndustryTerm depth-first search reactive engine module / bottom-up search / / Position scheduler / Coq proof assistant / / ProgrammingLanguage Objective Caml / ML / / Technology simulation / / SocialTag Computer science Formal methods Deterministic finite automaton Nondeterministic finite automaton Finite-state machine X-machine Non-deterministic Turing machine Ω-automaton Finite state transducer Models of computation

Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisaAdd to Reading List