Ask
Login
0
5.5kviews
Design a DFA for the regular expression (a+b)*aba
written 6.9 years ago by gravatar for teamques10 teamques10 ★ 68k •   modified 2.8 years ago
automata theory
ADD COMMENT EDIT
1 Answer
0
242views
written 6.9 years ago by gravatar for teamques10 teamques10 ★ 68k

$\epsilon$-–NFA for the problem is \ltcenter\gt![enter image description here][1]\lt/center\gt | States\Inputs | a | b | |---------------|---------|--------| | S | {B,C,D} | {B,C} | | A | {B,C} | {B,C} | | B | {D} | $\Phi$ | | C | {D} | $\Phi$ | | D | $\Phi$ | {E} | | E | {F} | $\Phi$ | | F | $\Phi$ | $\Phi$ |

S:

enter image description here

A:

enter image description here

B:

enter image description here

C:

enter image description here

D:

enter image description here

E:

enter image description here

F:

enter image description here

NFA for the problem is

enter image description here

States\Inputs a b
S {B,C,D} {B,C}
A {B,C} {B,C}
B {D} {I}
C {D} {I}
D {I} {E}
E {F} {I}
F {I} {I}
I {I} {I}

Final DFA is

enter image description here
ADD COMMENT EDIT
Please log in to add an answer.