PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: mn 31 1 1 1 1 1 1 1 1 2 1 2 1 1 1 1 1 2 1
1. Alph: Type
2. L: LangOver(Alph)
3. EquivRel x,y:Alph*. x L-induced Equiv y
4. Fin(Alph)
5. Fin(x,y:Alph*//L-induced Equiv(x,y))
6. l:Alph*. Dec(L(l))
7. g: Alph*
8. t:Alph*. L(t) g(t)
9. < (s,a. a.s),nil,g > Automata(Alph;x,y:Alph*//L-induced Equiv(x,y))
10. l: Alph*
11. b1,b2:. b1 = b2 (b1 b2)

g(l) = < (s,a. a.s),nil,g > (l)
By: Unfold `accept_list` 0
Generated subgoal:

1 g(l) = FinalState( < (s,a. a.s),nil,g > )(Result( < (s,a. a.s),nil,g > )l)

About:
equalboolapplypairlambdaconsniluniverse
listquotientallfunctionassertmemberimplies