RE: [Cse321] Clarification on structural induction

From: Venkatesan Guruswami (venkat@cs.washington.edu)
Date: Tue May 04 2004 - 19:07:27 PDT

  • Next message: Venkatesan Guruswami: "[Cse321] Clarification on structural induction" 
     
> Your goal is to prove that every string in S has at least 
> twice as many a's as b's. 

Of course the above should just be "at least as many a's as b's" with no
"twice".

Venkat

_______________________________________________
Cse321 mailing list
Cse321@cs.washington.edu
http://mailman.cs.washington.edu/mailman/listinfo/cse321
  • Next message: Venkatesan Guruswami: "[Cse321] Clarification on structural induction"

    This archive was generated by hypermail 2.1.6 : Tue May 04 2004 - 19:07:49 PDT