0
Design minimized DFA for accepting strings ending with 100 over alphabet (0,1).

Mumbai university > Comp > SEM 4 > TCS

Marks: 10M

Year: May 2015

0
0

A FA is called deterministic if it consists of a finite set of states and a set of transitions from state to state that occur on input symbol chosen from an alphabet Σ.

Logic:

Implementation:

$M = (Q,Σ , Ґ, δ,q_0, z_(0 ), F )$

$Q = {q_0, q_1, q_f}$

$Σ = {a, b}$

$Ґ = {X, R}$

$q_0 = q_0$

$z_0 = R$

$F = {q_f}$

Diagram:

0