n:
.
k:, f:(k
(x,y:n*//(x LangOf(OddEven#n)-induced Equiv y))).
Bij(k; x,y:n*//(x LangOf(OddEven#n)-induced Equiv y); f)
oddeven_minimization
== {i:
| 0 < i }
Thm* n:.
k:, f:(k(x,y:n*//(x LangOf(OddEven#n)-induced Equiv y))).
Bij(k; x,y:n*//(x LangOf(OddEven#n)-induced Equiv y); f)
oddeven_minimization
Thm* n:. OddEven#n 
Automata(n;(2
n)) auto_oddeven_wf
In prior sections: int 1 int 2 finite sets exponent action sets det automata automata 5