PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd ext valcom 1 1 1 1
1. Alph: Type
2. St: Type
3. NDA: NDA(Alph;St)
4. C: (StAlph*)*
5. ||C|| > 0
6. i:(||C||-1). ||2of(C[i])|| > 0
7. q: St
8. a: Alph
9. p: St
10. NDA(C) q
11. NDA(q,a,p)

I(NDA) = 1of(hd((map(c. < 1of(c),a.2of(c) > ;C) @ [ < p,nil > ])))
By: RWH (LemmaC Thm* l,m:T*. ||l|| > 0 hd((l @ m)) = hd(l)) 0
Generated subgoal:

1 I(NDA) = 1of(hd(map(c. < 1of(c),a.2of(c) > ;C)))

About:
equallambdapairconsniluniverseall
listimpliesnatural_numberproductsubtractapply