Consider the language L = {anbm : n ≥ 4, m ≤ 3}. Which regular expression represents L?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. aaaaa*(λ + b + bb + bbb)
Explanation
aaaaa* = aaaa·a* gives at least four a's, and (λ + b + bb + bbb) gives 0–3 b's. aaaa* allows only three a's.More Theory of Computation and Compilers questions
- Consider L = {ab, aa, baa}. Which of the following strings is NOT in L*?
- Consider the NPDA M = ({q0, q1, qf}, {a, b}, {1, z}, δ, q0, z, {qf}) with δ(q0, λ, z) = {(qf, z)} δ(q0, a, z) = {(q1, 11z)} δ(q1, a, 1) = {…
- Consider two instances X and Y of the Post Correspondence Problem, each with lists A and B of three strings over {0, 1}. Which of the follo…
- Consider the following properties of recursively enumerable sets: (A) Finiteness (B) Context-freedom (C) Emptiness Which of the following i…
- Consider the grammar S → SbS | a and the string abababa. Consider the statements: the string has (A) two parse trees (B) two leftmost deriv…
- Match List I with List II. Choose the correct answer from the options given below:List I List II A. Type 0 I. Finite automata B. Type 1 II.…