+1 vote
41 views

Consider the following non-deterministic finite automata(NFA) $A_{1}$ and $A_{2}:$

1. Give an example of a word which is accepted by both $A_{1}$ and $A_{2}.$
2. Give an example of a word which is accepted by $A_{1},$ but not by $A_{2}.$
3. Draw the deterministic finite automaton(DFA) equivalent to $A_{1}.$

retagged | 41 views

The Machine $A_1$ is accepting all strings that ends with $a$  i.e. $L_1 = \{a ,ba,aa, bba,aba, aaa, aba....\}$

The Machine $A_2$ is accepting all strings that starts with $b$ i.e. $L_2 = \{ b, ba, bb, baa, bbb, bab, bba ....\}$

$A.$    $ba$ is a string which is accepted by both $A_1$ and $A_2$

$B.$    $aa$ is a string which is accepted by $A_1$ but not by $A_2$

$C.$     The DFA for $A_1$ is as shown

.

by Boss (24.1k points)
edited by
0
Drawn DFA is not correct, its still NFA

$q_0$ will not contain the transition $\textbf{a}$ to itself and $q_1$ will contain the self loop $\textbf{a}$ to itself
0
yes correct...i will edit it soon

+1 vote