Nuprl Theory automata_4

(only non hidden objects are presented)

DISPauto_iso_dfauto_iso(<A1:first_automation:*>;<S1:first_state_set:*>; <Alph:alphabet:*>;<S2:second_state_set:*>;<A2:second_automation:*>) == <A1> <A2> <A1:A1:*> <A2:A2:*>== <A1> <A2>
ABSauto_isoA1 A2 == f:S1 S2 Bij(S1;S2;f) (s:S1. a:Alph. f (A1 s a) = A2 (f s) a) f I(A1) = I(A2) (s:S1. F(A1) s = F(A2) (f s))
THMauto_iso_wfAlph,S1,S2:. A1:Automata(Alph;S1). A2:Automata(Alph;S2). A1 A2
THMauto_iso_symAlph,S1,S2:. A1:Automata(Alph;S1). A2:Automata(Alph;S2). A1 A2 A2 A1
DISPrefine_dfrefine(<A1:automation_1:*>;<S1:state_set_1:*>;<Alph:alphabet:*>; <S2:state_set_2:*>;<A2:automation_2:*>) == <A1> <A2> <A1:A1:*> <A2:A2:*> == <A1> <A2>
ABSrefineA1 A2 == x,y:Alph List. A1(x) = A1(y) A2(x) = A2(y)
THMrefine_wfAlph,S1,S2:. A1:Automata(Alph;S1). A2:Automata(Alph;S2). A1 A2
DISPconnected_dfconnected(<A:automation:*>;<Alph:alphabet:*>;<St:state_set:*>) == Con(<A>) Con(<A:A:*>)== Con(<A>)
ABSconnectedCon(A) == s:St. l:Alph List. A(l) = s
THMconnected_wfAlph,St:. A:Automata(Alph;St). Con(A)
DISPcard_le_df|<S:S:*>| |<T:T:*>|== |<S>| |<T>|
ABScard_le|S| |T| == f:S T. Inj(S;T;f)
THMcard_le_wfS,T:. |S| |T|
DISPcard_ge_df|<S:S:*>| |<T:T:*>|== |<S>| |<T>|
ABScard_ge|S| |T| == f:S T. Surj(S;T;f)
THMcard_ge_wfS,T:. |S| |T|
COMle_vs_ge_com|S| |T| does not imply |T| |S|
THMrefine_geAlph,S1,S2:. A1:Automata(Alph;S1). A2:Automata(Alph;S2). Con(A1) Con(A2) A1 A2 |S1| |S2|
THMrefine_isoAlph,S1,S2:. A1:Automata(Alph;S1). A2:Automata(Alph;S2). Con(A1) Con(A2) L(A1) = L(A2) A1 A2 A2 A1 A1 A2
DISPlang_auto_dfA(<g:g:*>)== A(<g>)
ABSlang_autoA(g) == <s,a.(a::s), [], g>
THMlang_auto_wfAlph:. L:L(Alph). g:x,y:(Alph List)//(x Rl y) . A(g) Automata(Alph;x,y:(Alph List)//(x Rl y))
THMlang_auto_computeAlph:. L:L(Alph). g:x,y:(Alph List)//(x Rl y) . l:Alph List. A(g)(l) = l
THMlang_auto_lemAlph:. L:L(Alph). g:x,y:(Alph List)//(x Rl y) . (l:Alph List. L l (g l)) L(A(g)) = L
THMlang_auto_is_minAlph,St:. Auto:Automata(Alph;St). g:x,y:(Alph List)//(x Rl y) . Auto A(g)
THMhomo_initAlph,St:. Auto:Automata(Alph;St). g:x,y:(Alph List)//(x Rl y) . c:St Alph List. (q:St. Auto(c q) = q) c I(Auto) = []
THMhomo_stepAlph,St:. Auto:Automata(Alph;St). g:x,y:(Alph List)//(x Rl y) . c:St Alph List. (q:St. Auto(c q) = q) (q:St. a:Alph. c (Auto q a) = A(g) (c q) a)

the other theories