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

GATE 2008

Theory of ComputationFinite Automata: Regular LanguageseasyMCQ1 mark

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

A(a + b)* and (a* b*)*B(a + b)* and (a* + b*)*C(ab)* a and a (ba)*D(a + b)* and (a* b)*

Related Theory of Computation PYQs

Which of the following statements is false?

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

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

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

Which of the following problems on Turing machines is decidable?

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

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.