Answered step by step
Verified Expert Solution
Question
1 Approved Answer
3. (5 points) Describe the error in the following proof that 0* is not a regular language: The proof is by contradiction. Assume that 0*1*
3. (5 points) Describe the error in the following "proof" that 0* is not a regular language: "The proof is by contradiction. Assume that 0*1* is regular. Let p be the pumping length for 0*1* given by the pumping lemma. Choose s to be the string 0P1P. We know that s is a member of 0*1*, but we contradiction. So 0*1 is not regular
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