Consider the context-free grammar G1, with non-terminals {A}, terminals {0,1}, start symbol A, and productions below. Select the language that G1 corresponds to.
A -- 0 A 1 | 1 A 0 | ε

Question

Consider the context-free grammar G1, with non-terminals {A}, terminals {0,1}, start symbol A, and  productions below. Select the language that G1 corresponds to. 
 A --> 0 A 1 | 1 A 0 | ε

Accepted Answer

The set of words, where the right-hand side of each word is a mirror bit-flipped version of the left-hand side.

Answer

The set of words that contain the same number of 0's and 1's regardless of order.

Answer

The set of even length palindromes based on the alphabet {0,1}.

Answer

The set of words with n 0's followed by n 1's, or n 1's followed by n 0's, where n is a natural number.

Answer

The set of words constructed from any combination of 1's and 0's.

Crowdly

Consider the context-free grammar G1, with non-terminals {A}, terminals {0,1}, s...

Хочете миттєвий доступ до всіх перевірених відповідей на moodle.nottingham.ac.uk?