Peter Linz Edition 4 Exercise 2.2 Question 21 (Page No. 56)

Question

An nfa in which (a) there are no λ-transitions, and (b) for all $q ∈ Q$ and all $a ∈ Σ$, $δ (q,a)$contains
at most one element, is sometimes called an incomplete dfa. This is reasonable since the
conditions make it such that there is never any choice of moves.
For $Σ = $ {$a,b$}, convert the incomplete dfa below into a standard dfa

Answer 1

4 state is required for dfa

Comments

I wanted to check my answer, and I got the same one. Thanks!