1,055 views
0 votes
0 votes
Represent the language over ∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
Devshree Dubey asked Aug 15, 2018
2,165 views
Describe in simple English the language represented by the regular expression r=(1+10)*
0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
3