Let L= {ab, aa, baa}. Which of the following strings are not in L*?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. baaaaabaaaab
Explanation
After 'baa', the string 'baaaaabaaaab' leaves 'aaabaaaab'. Any split ends with a lone b or a lone a (the final 'aaaab' block cannot be covered by aa/ab), so it is not in L*. The other three strings split into ab, aa and baa pieces.
More Theory of Computation and Compilers questions
- Let A={a, b} and L=A*. Let X={anbn, n>0}. The languages L U X and X are respectively :
- Which of the following symbol table implementations is best suited if access time is to be minimum?
- The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ' P ' state is equal to :
- Three address codes can be represented in special structures known as : (A) Quadruples (B) Triples (C) Patterns (D) Indirect Triples
- Which of the statement is/are CORRECT ? (A) Moore and Mealy machines are finite state machines with output capabilities. (B) Any given Moor…
- Match List - I with List - II according to input to the compiler phase that process it :