An Introduction to Automata Theory

agent Aunt Eugenia automata theory B₁ B₂ behaviour assignment behavioural equivalence bijective cell Chapter circ circuit composition compute construct define Definition Let denote the set described elements emptyable encoded equivalence relation Eratosthenes example exists flow table formal function ghetto ghetto-b given gives GOTO graph Hasse diagram hence homomorphism I₁ image machine implementation input input/output input/output behaviour isomorphism labelled language lattice live with respect M₁ M1 and M2 M₂ marked graph marking Mealy machine mood Moore machines N₁ Nmin non-empty set non-trivial SP partitions Note output consistent p₁ pair parallel decomposition poset Proof Proposition Prove reduction reset machine S₁ S₂ serial decomposition siphon SP partitions strongly connected subsets Suppose M1 symbol T₁ theorem tion Tmin tokens transition Turing machine vectors X₁ π₁ л₁ л½ л₂