Unformatted text preview: Try to generalize your answer to the same question for the ith symbol from the right. 4. (From Jeff Edmonds' notes) Consider the alphabet {0,1}. Design a DFA for the language L = {w  w has length at most 3} 5. (From Jeff Edmonds' notes) Consider the alphabet {0,1}. Design a DFA for the language L = {epsilon, 0, 010, 10, 11} 6. Is the language L = {0^m1^n  m <> 2n+1} regular? Is it context free?...
View
Full
Document
This note was uploaded on 12/11/2010 for the course CSE CSE 2001 taught by Professor N during the Winter '10 term at York University.
 Winter '10
 n

Click to edit the document details