2,165 views
0 votes
0 votes
Describe in simple English the language represented by the regular expression r=(1+10)*

2 Answers

3 votes
3 votes
L =  language containing all strings over 0,1 except string starting from 0 and containing consecutive 0's

Related questions

0 votes
0 votes
0 answers
1
Devshree Dubey asked Aug 15, 2018
1,055 views
Represent the language over ∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's.
0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
3