Arrange in appropriate order the construction of a finite automaton:
A. Minimum-state DFA
B. Regular expression
C. NFA-ε
D. Problem statement
E. DFA
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. D, B, C, E, A
Explanation
Start from the problem statement, write a regular expression, build an ε-NFA (Thompson), convert to a DFA (subset construction), then minimise it.More Theory of Computation and Compilers questions
- The grammar stmt → if expr then stmt else stmt | if expr then stmt suffers from:
- The language of the following PDA would be: δ(q0, a, z0) = (q0, aaaz0) δ(q0, a, a) = (q0, aaaa) δ(q0, b, a) = (q1, λ) δ(q1, b, a) = (q1, λ)…
- For the given two machines over {a, b}, which of the following is correct? Machine 1: states A (start), B (final); A –a→ A, A –a→ B, B –b→…
- The number of tokens in the line ' for i in range (begin; end ; step) : ' is:
- In the pumping lemma for context-free languages, for a string uvwxy, what is the minimum length of vx together?
- Which of the following is an ε-free grammar?