Question: Prove whether language is regular or not. L is subset of sigma*, sigma's alphabet is c, d L = (cd)^m * (d)^n m >= 2,
Prove whether language is regular or not. L is subset of sigma*, sigma's alphabet is c, d
L = (cd)^m * (d)^n m >= 2, n >= 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
