Finite Automata: Regular Languages GATE 2008 Question #7503 with Solution

GATE 2008

Theory of ComputationFinite Automata: Regular LanguageseasyMCQ1 mark

Which of the following statements about regular expressions and finite automata is FALSE?

AEvery regular expression can be converted into an equivalent NFA.BEvery NFA can be converted into an equivalent DFA.CA language accepted by a DFA with n states can always be accepted by an NFA with fewer than n states.DThe language of a minimal DFA is unique up to state renaming.

Save your progress

Related Theory of Computation PYQs

GATE 2008

Which of the following statements is false?

GATE 2008

Which of the following is true for the language { ap | p is prime} ?

GATE 2008

Let L be a regular language. Which of the following operations is NOT closed for regular languages?

GATE 2008

The language L = {<M> | M is a Turing Machine that accepts the string 'gate'} is:

GATE 2008

Which of the following pairs of regular expressions are NOT equivalent?

GATE 2008

Which of the following problems on Turing machines is decidable?

Saved progressKeep answers, mock results and completion history across devices.

Adaptive practiceGet questions matched to your recent accuracy and difficulty level.

Bookmarks and notesBuild a personal revision list and record why a question was difficult.

Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.

Related Theory of Computation PYQs

Turn practice into measurable progress