Consider the following simple language L. It consists of all sequences that have at least one...

Transcribed Image Text:

Consider the following simple language L. It consists of all sequences that have at least one 0, then at least one 1, and again at least one 0, and the total number of zeroes and ones is the same. For example: 001111110000 is in L 00111111000 is not in L: too few zeroes 00110110 is not in L: there is a zero inside ones Now consider three grammars, one of which defines this language correctly. Each grammar has two terminal symbols, 0 and 1, and the start/goal symbol is . The language is correctly defined by: Consider the following simple language L. It consists of all sequences that have at least one 0, then at least one 1, and again at least one 0, and the total number of zeroes and ones is the same. For example: 001111110000 is in L 00111111000 is not in L: too few zeroes 00110110 is not in L: there is a zero inside ones Now consider three grammars, one of which defines this language correctly. Each grammar has two terminal symbols, 0 and 1, and the start/goal symbol is . The language is correctly defined by: