Question

QUESTION 4 What language does this final state PDA accept? / Is the start stack symbol and F is the final state) (S.a.X.nop,S) (S,b,X,nop,F) OO None of the choices O ab O aab ab QUESTION 5 Below is an empty stack PDA (X is the start stack symbol. O is the start state) with three transition rules: Rule1: (0,a.X.push(0,0) Rule2: (0,,X.pop,1) Rule3: (1.b.X.pop.1) Which of the following sequence of PDA transitions show that the string ab is valid ? Rulei, Rulei, Rule2, Rule3, Rule3 Rule 1, Rule1, Rule 1, Rule2, Rule3, Rule3, Rule3 Rulei, Rule2, Rule3 None of the choices

Answer 1

question-4:

ans: a*b

(S,a,X,nop,S) S state is taken 'a' and remains in same state "S" . it leads to- a*

(S,b,X,nop,F) S state is taken 'b' and go to state "F". it leads to - b

so finally produced----a*b

question-5:

ans: rule1, rule2, rule3.

the following sequence produce 'ab' string.

IF YOU HAVE ANY QUERIES REGARDING ANSWER, PLEASE ASK ME AT COMMENT SECTION.

PLEASE GIVE LIKE.

THANK YOU.