Question: ( Q - M ) Prove or disprove that the union of two non - regular languages is always nonregular.
QM Prove or disprove that the union of two nonregular languages is always nonregular.
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
