Concept drill

finite state machine

GATE CSE & IT · Turing Machines & Computability · 2000-2000

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 →

2000 PYQ

Consider the following decision problems : $${P_1}$$ Does a given finite state machine accept a given string $${P_2}$$ Does a given context free grammar generate an infinite number...

easyanswer keybasic explanation