Consider the following language L.
L = { w | w ϵ (0+ 1)*, n1(w) = 3n | n ≥ 0}
Identify equivalent regular expression that generates L.1
0*10*10*10*
2
(0*10*10*10*)*
3
0* + (0*10*10*10*)*
4
0* + (111)*
Consider the following language L.
L = { w | w ϵ (0+ 1)*, n1(w) = 3n | n ≥ 0}
Identify equivalent regular expression that generates L.