practice - Try to generalize your answer to the same...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Practice problems: 1. Consider the alphabet {a,b}. Design a DFA for the language L = {w | |w|>0, and the difference in the number of a's and b's is even} 2. Consider the alphabet {a,b}. Design a DFA for the language L = {w | |w|>0, and w has an even number of a's and an odd number of b's} 3. Consider the alphabet {0,1}. Design a DFA for the language L = {w | |w|>1, and the second symbol from the right in w is 1}. What is the minimum number of states that are needed?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Try to generalize your answer to the same question for the i-th 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

Ask a homework question - tutors are online