1
$\begingroup$

The given language is this. $$L = \{a^nb : n \geq 0\}$$ Let $M = \left<\{q_0,q_1,q_2\},q_0,\Gamma=\{a,b\},\delta,\{q_2\}\right>$ be a DFA, where $q_0$ is the initial state, $q_2$ is the accept state.

For this language is this DFA accept it?? DFA of L

The trap state is for any input that is greater than any string in $L$ such as $aabb.$

$\endgroup$
1
$\begingroup$

You need to add transitions $q_2\overset{a,b}\longrightarrow q_2$ to make it a true DFA, but otherwise it’s fine.

$\endgroup$
  • $\begingroup$ oh Thaks...!! forgot to put that transition. $\endgroup$ – eChung00 Oct 29 '13 at 0:35
  • 1
    $\begingroup$ @eChung00: You’re welcome. $\endgroup$ – Brian M. Scott Oct 29 '13 at 7:38

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.