GATE CSE Concept Authority Hub

Theory of Computation Solved GATE Questions

Explore DFA/NFA minimization, context-free grammars (CFG), Turing machines, undecidability, and Chomsky hierarchy proofs.

Indexed Doubts 12 Questions
Core Syllabus Focus GATE & ISRO CS

Practice Questions (12)

NQuestions1020

Regular Expressions and DFA State Counts (Variation 10)

What is the minimum number of states in a Deterministic Finite Automaton (DFA) that recognizes the language defined by the regular expression: $r = ...

Asked by NileshNama Votes: 30 | Views: 210
NQuestions1019

Undecidability and Rice's Theorem Applications (Variation 9)

Which of the following problems are **UNDECIDABLE**? Select all that apply. 1. Determining if a given Turing Machine $M$ halts on an empty tape. 2...

Asked by Rahul_Mehta Votes: 29 | Views: 202
NQuestions1018

Closure Properties of Regular and Context-Free Languages (Variation 8)

Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is **NOT GUARANTEED** to be context-free?...

Asked by Ananya_Sharma Votes: 28 | Views: 194
NQuestions1017

Regular Expressions and DFA State Counts (Variation 7)

What is the minimum number of states in a Deterministic Finite Automaton (DFA) that recognizes the language defined by the regular expression: $r = ...

Asked by Kiran_Kumar Votes: 27 | Views: 186
NQuestions1016

Undecidability and Rice's Theorem Applications (Variation 6)

Which of the following problems are **UNDECIDABLE**? Select all that apply. 1. Determining if a given Turing Machine $M$ halts on an empty tape. 2...

Asked by Pradyumna_Rao Votes: 26 | Views: 178
NQuestions1015

Closure Properties of Regular and Context-Free Languages (Variation 5)

Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is **NOT GUARANTEED** to be context-free?...

Asked by NileshNama Votes: 25 | Views: 170
NQuestions1014

Regular Expressions and DFA State Counts (Variation 4)

What is the minimum number of states in a Deterministic Finite Automaton (DFA) that recognizes the language defined by the regular expression: $r = ...

Asked by Rahul_Mehta Votes: 24 | Views: 162
NQuestions1013

Undecidability and Rice's Theorem Applications

Which of the following problems are **UNDECIDABLE**? Select all that apply. 1. Determining if a given Turing Machine $M$ halts on an empty tape. 2...

Asked by Ananya_Sharma Votes: 23 | Views: 154
NQuestions1012

Closure Properties of Regular and Context-Free Languages

Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is **NOT GUARANTEED** to be context-free?...

Asked by Kiran_Kumar Votes: 22 | Views: 147
NQuestions1011

Regular Expressions and DFA State Counts

What is the minimum number of states in a Deterministic Finite Automaton (DFA) that recognizes the language defined by the regular expression: $r = ...

Asked by Pradyumna_Rao Votes: 21 | Views: 138
NQuery1779779372237

i want to check queriesss

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500...

Asked by Veb_Glitch Votes: 3 | Views: 2
NQuery1780107910908

Hello thisis thies niles nama

Hellomy name is nilesh what you want to ask to me...

Asked by Veb_Glitch Votes: 1 | Views: 8

Explore Other GATE CSE Subjects

Operating SystemsComputer NetworksDatabase Management SystemsEngineering MathematicsComputer Organization and ArchitectureDigital LogicData StructuresAlgorithmsCompiler Design