Every regular language is a DCFL, so a DPDA accepts it. DPDAs are strictly weaker than NPDAs (e.g., even palindromes), and decidable languages go beyond CFLs.
More Regular and Context-Free Languages, Pumping Lemma questions
GATE 2025 CS (CS2) Q30– Consider the two lists List I and List II given below: List I List II --- --- (i) Context…
GATE 2025 CS (CS2) Q52– Let = \a, b, c\. For x *, and , let \# (x) denote the number of occurrences of in x. Which…
GATE 2024 CS (CS1) Q23– Let L 1,L 2 be two regular languages and L 3 a language which is not regular. Which of the…
GATE 2023 CS Q24– Which of the following statements is/are CORRECT?
GATE 2022 CS Q23– Which of the following statements is/are TRUE?
GATE 2022 CS Q47– Consider the following languages: L 1=\anwan w\a,b\*\ L 2=\wxwR w,x\a,b\*, w , x >0\ Note…