automata 5 Sections AutomataTheory Doc

Def |S| |T| == f:(ST). Surj(S; T; f)

Thm* Auto:Automata(Alph;St), S:Type, A:Automata(Alph;S). Fin(Alph) Fin(St) LangOf(Auto) = LangOf(A) Con(A) |S| |x,y:Alph*//(x LangOf(Auto)-induced Equiv y)| any_ge_min_auto

In prior sections: automata 4