Find a regular expression to describe:
The set of all strings over the alphabet {a, b, c, d} that contain exactly one a and exactly one b
So, for example, the following strings are in this language:
ab, ba, cccbad, acbd, cabddddd, ddbdddacccc
and the following strings are NOT in this language:
a, ccbc, acbcaaacba, acacac, bcbbbbbca, aca, c, d,
b
Get Answers For Free
Most questions answered within 1 hours.