Constructive Proof — Proof techniques in Theory of Computation
⭐ What Is a Constructive Proof? (In Simple Words) A constructive proof shows something exists by explicitly building it. So
Continue reading
Category: Theory of Computation
Direct proofs — Proof techniques Theory of Computation
⭐ What Is a Direct Proof? A direct proof is a method where you: It’s like someone tells you: “If
Continue reading
Undecidability MCQs (Theory of Computation) — GATE Level
Undecidability MCQs (Theory of Computation) — GATE Level Q1.Which of the following problems is undecidable?A) Checking if a DFA accepts
Continue reading
Turing Machines (Theory of Computation) MCQs
Turing Machines (Theory of Computation) MCQs
Continue reading
Pumping Lemma(Theory of Computation) MCQs
Pumping Lemma (for both Regular and Context-Free Languages) Q1.Consider the language L = { aⁿbⁿ | n ≥ 0 }.
Continue reading
Context-Free Languages (Theory of Computation) MCQs
Context-Free Languages (Theory of Computation) MCQs Note: these questions assume the usual alphabets (like Σ = {a,b,c} or {0,1}) unless
Continue reading
Regular Languages (Theory of Computation) MCQs
Regular Languages (Theory of Computation) MCQs
Continue reading
Pushdown Automata(Theory of Computation) MCQs
Pushdown Automata(Theory of Computation) — 100 Tricky MCQs for GATE Q1. A Pushdown Automaton (PDA) differs from a Finite Automaton
Continue reading
Context-Free Grammars(Theory of Computation) MCQs
Context-Free Grammars(Theory of Computation)
Continue reading
Finite Automata(Theory of Computation) MCQs for Gate Exam
Finite Automata Tricky GATE MCQs with Solutions Q1. Which of the following is not true for Deterministic Finite Automata (DFA)?
Continue reading