Question: Consider the following invalid proof that A cup { epsi } is regular if A is regular: Since A is regular, it has
Consider the following invalid proof that A cup epsi is regular if A is regular:
Since A is regular, it has a NFA N We can create an NFA N for A cup epsi modifying N by setting the start state to be accepting. Then N accepts Acup epsi QED
Show that this proof is invalid by giving a regular language A and an NFA N for A such that constructing N as described in the proof does not accept Acup epsi
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
