Question

Show that a deterministic finite automaton with n states accepting a
nonempty set accepts a string of length m, m < n.

Answer 1

Answer:

Designing Deterministic Finite Automata (Set 1)

Prerequisite – Designing finite automata

In this article, we will see some designing of Deterministic Finite Automata (DFA).

Problem-1: Construction of a DFA for the set of string over {a, b} such that length of the string |w|=2 i.e, length of the string is exactly 2.

Explanation:

The desired language will be like:

Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.