LIVE Course for free

Rated by 1 million+ students
Get app now
JEE MAIN 2023
JEE MAIN 2023 TEST SERIES
NEET 2023 TEST SERIES
NEET 2023
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
41 views
in Computer by (71.8k points)

Consider the transition diagram of a PDA given below with input alphabet Σ = {a, b} and stack alphabet Γ = {X , Z}. Z is the initial stack symbol. Let L denote the language accepted by the PDA.

Which one of the following is TRUE?

(A) L = {anbnIn≥0} and is not accepted by any finite automata

(B) L= {an≥0} ∪ {anbnIn≥0} and is not accepted by any deterministic PDA 

(C) L is not accepted by any Turing machine that halts on every input

(D) L = {anIn≥0} U (anbnIn≥0) and is deterministic context-free

Please log in or register to answer this question.

1 Answer

+1 vote
by (70.9k points)

(D) L = {anIn≥0} U (anbnIn≥0) and is deterministic context-free

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...