What people are saying - Write a review
We haven't found any reviews in the usual places.
Implementing Finite Automata
Implementation and Realisation
10 other sections not shown
agent asleep Aunt Eugenia automata theory behaviour assignment behaviour expression behavioural equivalence bijective Cartesian product Chapter circuit composition compute consider construct define Definition Let denote the set described elements emptyable encoded equivalence relation Eratosthenes example exercise exists flow table formal function ghetto ghetto-b gives GOTO Hasse diagram hence homomorphism image machine implementation injective injective functions input/output input/output behaviour isomorphism labelled language lattice Lemma Suppose live with respect lnth(x machines Mx marked graph maudlin Mealy automaton Mealy machine mood Moore machines msc subnet nets non-empty set non-trivial SP partitions Note output consistent pair parallel decomposition partially ordered partially ordered set poset Prove reduction reset machine satisfies serial decomposition siphon SP(M strongly connected subsets symbol theorem tion tokens transition Turing machine unspeakable vectors video nasty