Question: Design the DFA to accept the language containing all the strings over that starts and ends with different symbols.

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:**

Please log in to add an answer.