Regular Expressions — Theory of Computation
⭐ A Simple Way to Think About Regular Expressions If strings were people in a crowd, then a regular expression …
Theory of Computation
Pumping Lemma(Theory of Computation) MCQs
Pumping Lemma (for both Regular and Context-Free Languages) Q1.Consider the language L = { aⁿbⁿ | n ≥ 0 }. …
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 …
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 …
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)? …