Nuprl Theory automata_6

(only non hidden objects are presented)

DISPauto1_dfAuto== Auto
ABSauto1Auto == <s,a.s, 0, s.tt>
THMauto1_wfAuto Automata(2;2)
THMauto1_minimizationn: f:n x,y:(2 List)//(x Rl y). Bij(n;x,y:(2 List)//(x Rl y);f)
COMauto1_howtoIf you want to get number of state in minimal automata that accepts the same language as Auto just type term_to_string (evaluate_term ext{auto1_minimization}) into your ML top loop. But keep in mind that in order to get ext{auto1_minimization} you will need to open a term slot with Ctrl+o and type in "auto1_minimization". In several minutes you will get lots of line as output. Just look for a first number!
DISPauto2_dfAuto== Auto
ABSauto2Auto == <s,a.2 - s, 0, s.(s = 0)>
THMauto2_wfAuto Automata(2;3)
THMauto2_minimizationn: f:n x,y:(2 List)//(x Rl y). Bij(n;x,y:(2 List)//(x Rl y);f)
DISPauto3_dfAuto== Auto
ABSauto3Auto == <s,a.a, 0, s.(s = 0)>
THMauto3_wfAuto Automata(3;3)
THMauto3_minimizationn: f:n x,y:(3 List)//(x Rl y). Bij(n;x,y:(3 List)//(x Rl y);f)
DISPauto3_1_dfAuto3_1== Auto3_1
ABSauto3_1Auto3_1 == <s,a.a, 0, s.tt>
THMauto3_1_wfAuto3_1 Automata(1;1)
THMauto3_1_minimizationn: f:n x,y:(1 List)//(x Rl y). Bij(n;x,y:(1 List)//(x Rl y);f)
DISPauto3_2_dfAuto3_2== Auto3_2
ABSauto3_2Auto3_2 == <s,a.a, 0, s.tt>
THMauto3_2_wfAuto3_2 Automata(2;2)
THMauto3_2_minimizationn: f:n x,y:(2 List)//(x Rl y). Bij(n;x,y:(2 List)//(x Rl y);f)
DISPauto3_23_dfauto3_23()== auto3_23()
ABSauto3_23auto3_23() == <s,a.a, 0, s.tt>
THMauto3_23_wfauto3_23() Automata(2;3)
THMauto3_23_minimizationn: f:n x,y:(2 List)//(x Rl y). Bij(n;x,y:(2 List)//(x Rl y);f)
DISPauto3_3_dfauto3_3()== auto3_3()
ABSauto3_3auto3_3() == <s,a.a, 0, s.tt>
THMauto3_3_wfauto3_3() Automata(3;3)
THMauto3_3_minimizationn: f:n x,y:(3 List)//(x Rl y). Bij(n;x,y:(3 List)//(x Rl y);f)
DISPauto4_dfAuto4== Auto4
ABSauto4Auto4 == <s,a.1 - s, 0, s.(s = 0)>
THMauto4_wfAuto4 Automata(2;2)
THMauto4_minimizationn: f:n x,y:(2 List)//(x Rl y). Bij(n;x,y:(2 List)//(x Rl y);f)

the other theories