Concept drill

finite automaton

GATE CSE & IT · Regular Languages · 2002-2002

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Hopcroft-Ullman / Dragon Book

Automata, languages, parsing, syntax-directed translation

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

2002 PYQ

The smallest finite automaton which accepts the language $$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has

easyanswer key