DFA Category 1: Accept Only the Given Input

 DFA accepts only one specific input string and rejects all others. For Examples

• Accepts only abbbbccc
• Accepts only 011010010
• Accepts only 101010

DFA Example: 

Design a DFA over ∑ = {0, 1} that accepts only the input string “10”.

DFA Description

• States = {q0, q1, q2, q3}

• Input Alphabet = {a, b}

• Initial State = q0

• Final State = {q2}

• Trap State ={q3}

Transition Table

Transition Table for the above Deterministic Finite Automata (DFA) is

DFA Example:

Construct a DFA with ∑ = {a, b} that accepts only the input “abbb”.

Solution:

DFA Description

• States = {q0, q1, q2, q3, q4, q5}

• Input Alphabet = {a, b}

• Initial State = q0

• Final State = {q4}