- L={0,1} where all strings are having at least two occurrence of the substring 00 and this one
- L= {a^n b^m, n ≥ 4, m ≥ 3}
- Set of string over the alphabet {a,b,c} containing at least one a and one b
What will be the regular expression or the following languages?
ajax007
- 1
- 1