PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd ext valcom 1 1 2 2 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)

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

1 ||map(c. < 1of(c),a.2of(c) > ;C) @ [ < p,nil > ]||1

About:
lambdapairconsnilnatural_numberuniverseall
listequalintproductsubtractapply