Let L = {ab, aa, baa}. Which of the following strings is NOT in L*?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. baaaaabaaaab
Explanation
A = ab|aa|baa|ab|aa, B = aa|aa|baa|aa and D = baa|aa|ab|aa are all in L*. In C the final 'b' can only come from 'ab' or start a 'baa'. Every way of splitting the preceding a's leaves a single unmatched symbol, so C cannot be formed.More Theory of Computation and Compilers questions
- Let A = {a, b} and L = A*. Let X = {aⁿbⁿ | n > 0}. The languages L ∪ X and X are respectively:
- Which of the following symbol-table implementations is best suited if access time is to be minimum?
- Consider the grammar E → E + n | E × n | n. For the sentence n + n × n, the handles in the right-sentential forms of the reduction are:
- One of the purposes of using intermediate code in compilers is to:
- The sum of the minimum and maximum number of final states for a DFA having P states is equal to:
- Three-address code can be represented in special structures known as: (A) Quadruples (B) Triples (C) Patterns (D) Indirect Triples Choose t…