Help me for this question by using the properties of regular language, please
Proof by contradiction -
Let L' = {a^{p}b^{q} | p,q are not prime} be a regular language.
Then, by concatenation L' = L1.L2 where L1 = {a^{p} | p
is not prime} and L2 = {b^{q} | q is not prime}
L1 and L2 are regular languages. (concatenation
property)
L1' = {a^{p} | p is prime} therefore L1' is also regular
but this contradicts the given statement that {a^{p} | p is
prime} is not regular. (complement property)
Hence, our assumption that {a^{p}b^{q} | p,q are
not prime} is a regular language is also wrong.
Hence, proved.
Comment for any issues and upvote(like) if satisfied.
Help me for this question by using the properties of regular language, please stven L= {oll p is prime? is not regular....