edited by
4,440 views

1 Answer

4 votes
4 votes

a)

  a b

1

2

1,2

-

2

1

 

DFA transition table

  a b

1

[12]

2

Ф

[12]

[12]

Ф

Ф

2

[12]

1

Ф

 

in the DFA initial state is 1 and final states are 1 and [12]

Related questions

2 votes
2 votes
1 answer
1
admin asked Apr 21, 2019
7,976 views
Use the procedure described in $\text{Lemma 1.60}$ to convert the following finite automata to regular expressions.
0 votes
0 votes
1 answer
2
admin asked Apr 21, 2019
6,202 views
Use the procedure described in $\text{Lemma 1.55}$ to convert the following regular expressions to non-deterministic finite automata.$(0\cup 1)^{*}000(0\cup 1)^{*}$$(((0...
0 votes
0 votes
1 answer
3
admin asked Apr 21, 2019
3,429 views
Give an $NFA$ recognizing the language $(01 ∪ 001 ∪ 010)^{*}.$Convert this $NFA$ to an equivalent $DFA.$ Give only the portion of the $DFA$ that is reachable from the...