Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Let A = {omega elementof {a, b}* | omega contains more a's than b's}. Suppose you are trying to prove that A is not regular
Let A = {omega elementof {a, b}* | omega contains more a's than b's}. Suppose you are trying to prove that A is not regular using the pumping lemma. Your proof starts (correctly) like this: Suppose for a contradiction that A is regular. Let p be the pumping length given by the pumping lemma. Now you have to choose string s. For each choice of s below, state whether or not this choice of s can be used to finish the proof that A is not regular. If your answer is YES you do not have to explain anything. If your answer is NO. you should also briefly explain why it can not be used. (a) s = a^p+1 b. (b) s = a^p+1 b^P. (c) s = a^pb^p. (d) s = (ab)^p a. (e) s = baa. (f) s = b^pa^p+1
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started