Describe a regular grammar that generates the regular language of all strings in {0,1} that do not contain two consecutive 0's S->A A->0B | 1A | E B->1A | E E is empty Are correct ?
Follow Math Help Forum on Facebook and Google+
Correct. Another one: S -> A A -> 0 | 1A | 01A | E
Thank you
View Tag Cloud