Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

modulo counter

GATE CSE & IT · Regular Languages · 1987-1987

1
PYQs
0%
keyed
0
elite explanations
1
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 →
1987 PYQ

Give minimal $$DFA$$ that performs as a Mod-$$3$$ $$1's$$ counter, i.e., outputs a $$1$$ each time the number of $$1's$$ in the input sequence is a sequence is a multiple of $$3.$$

easy