Which of the following languages can be proven NOT to be context-free using the Pumping Lemma?
MCQ Subject: Theory of Computation & Automata
-
Which of the following operations results in a language that is guaranteed…
Which of the following operations results in a language that is guaranteed to be regular if L1 and L2 are regular languages?
-
Which complexity class includes decision problems where a proposed solution can be…
Which complexity class includes decision problems where a proposed solution can be verified in polynomial time?
-
What distinguishes NFA from DFA in terms of transition capability?
What distinguishes NFA from DFA in terms of transition capability?
-
Consider the language L = {a^p | p is a prime number}.…
Consider the language L = {a^p | p is a prime number}. Which of the following is TRUE about L?
-
Which of the following statements about Context-Free Grammars (CFGs) is TRUE?
Which of the following statements about Context-Free Grammars (CFGs) is TRUE?
-
Which of the following statements about language closure properties is correct?
Which of the following statements about language closure properties is correct?
-
In a Deterministic Finite Automaton (DFA), what is the primary distinction between…
In a Deterministic Finite Automaton (DFA), what is the primary distinction between a state that is both final and has outgoing transitions versus a state in a minimal DFA?
-
Which language cannot be recognized by a finite automaton?
Which language cannot be recognized by a finite automaton?
-
Which of the following accurately describes a characteristic of a Deterministic Finite…
Which of the following accurately describes a characteristic of a Deterministic Finite Automaton (DFA)?