Theory of Computation MCQ

What is a finite automaton (FA)?

What is a regular language?

What does DFA stand for?

What is the difference between a DFA and an NFA?

What is a regular expression?

What is a context-free grammar (CFG)?

What type of automaton recognizes context-free languages?

What is a Turing machine?

What does the Church-Turing thesis claim?

What is the Halting Problem?

What is a decidable language?

What is the Chomsky hierarchy?

What does ε (epsilon) represent in formal language theory?

What is the Kleene star operation?

What is an ε-NFA?

What is the language of a grammar?

What is a terminal symbol in a grammar?

What is ambiguity in a context-free grammar?

What is the union of two regular languages?

What is the complement of a language L over alphabet Σ?

What is a parse tree?

What is the language {aⁿbⁿ | n ≥ 0}?

What does it mean for a language to be recursively enumerable (RE)?

What is a leftmost derivation?

What is a dead state in a DFA?

What is the state minimization of a DFA?

What does the subset construction algorithm do?

What is Greibach Normal Form (GNF)?

What is Chomsky Normal Form (CNF)?

What is a linear bounded automaton (LBA)?

What is a transducer?

What is a language that is RE but not decidable?

What is the CYK (Cocke-Younger-Kasami) algorithm?

What is the difference between a recognizer and a decider?

What does it mean for a problem to be undecidable?

What is a nondeterministic Turing machine (NTM)?

What is the significance of the Empty Language ∅ in formal languages?

What is a production rule in a grammar?

What is a Moore machine?

What is the concatenation of languages L₁ and L₂?

What is the Pumping Lemma for regular languages used for?

What language does the language {aⁿbⁿcⁿ | n ≥ 1} belong to?

What is a closure property in formal language theory?

What does the Myhill-Nerode theorem characterize?

What is Rice's theorem?

What is the Earley parser algorithm used for?

What is the difference between LL and LR parsing?

What is the emptiness problem for CFGs?

What is reduction in computability theory?

What is the Post Correspondence Problem (PCP)?

What is the complexity class P?

What is the complexity class NP?

What is an NP-complete problem?

What was the first problem proven NP-complete?

What is the Pumping Lemma for context-free languages?

What is the complexity class PSPACE?

What is Savitch's theorem?

What is the complexity class co-NP?

What is the polynomial hierarchy?

What is a Mealy machine?

What is the two-stack PDA and its expressive power?

What is a time-constructible function?

What is the relationship between decidability and semi-decidability?

What is a 3-SAT problem?

What is the space complexity class L (LOGSPACE)?

What is the self-reference in Kleene's recursion theorem?

What is an oracle Turing machine?

What is interactive proof system (IP class)?

What is zero-knowledge proof?

What does the acronym EXPTIME mean?

How do you systematically convert a regular expression into an NFA?

How do you prove that the language L = {0ⁿ1ⁿ | n ≥ 0} is not regular?

Which closure property distinguishes regular languages from context-free languages?

How would you construct a context-free grammar for the language {aⁱbʲ | i ≠ j}?

Why is left recursion a problem for top-down (LL) parsers, and how is it resolved?

How is the product construction used to build a DFA for the intersection of two regular languages?

What technique converts a CFG into Chomsky Normal Form, and why is it useful?

Which of the following problems about finite automata is decidable?

How does the subset construction explain why an n-state NFA can require up to 2ⁿ states when converted to a DFA?

How can you show that context-free languages are closed under concatenation but not under intersection?

What does the Time Hierarchy Theorem prove?

What is the Immerman-Szelepcsényi theorem?

What is the significance of showing that a language is not context-free using the CFL Pumping Lemma?

What is Ladner's theorem and what does it imply?

What is an oblivious Turing machine and why is it important for complexity?

What is descriptive complexity theory?

What is the Karp-Lipton theorem?

What is Arthur-Merlin protocol (AM class)?

What is the connection between Boolean circuits and uniform complexity classes?

What is the Razborov-Smolensky theorem?

What is the Toda's theorem in complexity theory?

What is the #P complexity class?

What is the relationship between NL and co-NL?

What is the Baker-Gill-Solovay result about oracles?

What is the PCP theorem?

What is derandomization and its connection to circuit lower bounds?

What is the complexity class BPP?

What is a universal Turing machine?

What is the connection between NP-hardness and approximation algorithms?

What does the Space Hierarchy Theorem establish, and how does it differ from the Time Hierarchy Theorem?