| A. Ginzberg. Algebraic Theory of Automata. Academic Press, 1968. |
....It was noticed during the development of automata theory that the preservation of arrows in the category of nite automata is not enough to 4 characterize which automata are equivalent. Instead, one needed to use structure preserving relations, variously called coverings or simulations (see [Gin68] for instance) Milner [Mil71] applied a similar technique, using simulations between programs to show the equivalence of programs. Reynolds [Rey83] derived a notion of uniformity, called relational parametricity, in terms of respecting simulation relations. We review relational parametricity ....
A. Ginzberg. Algebraic Theory of Automata. Academic Press, 1968.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC