What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. 5
Explanation
Minimizing the given automaton (merging equivalent states and dropping unreachable ones) leaves 5 states, per the official key.
More Theory of Computation and Compilers questions
- Find the regular expression for the language accepted by the automata given below.
- What language is accepted by the PDA M = ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) where in q0 every input symbol is pushed, δ(q0,…
- Match List I (production rules) with List II (grammar). List I: A. S → XY, X → 0, Y → 1. B. S → aS | bSS | c. C. S → AB, A → 0A | 1A | 0, B…
- Which of the following concepts can be used to identify loops? A. Depth first ordering B. Dominators C. Reducible graphs
- Given below are two statements Statement I: LL(1) and LR are examples of Bottom‐up parsers. Statement II: Recursive descent parser and SLR…
- Let L = L₁ ∩ L₂, where L₁ = {0ᵐ1ᵐ2 0ⁿ1ⁿ | m, n ≥ 0} and L₂ = {0ᵐ1ⁿ2ᵏ | m, n, k ≥ 0}. Then L is