The Gateway to Computer Science Excellence
0 votes
134 views


Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0  is the bottom of stack marker. The set of states of PDA is {q0,q1} where q0 is the start state and rules of the PDA are,  (The languare accepted by the grammar is)

 

 

in Theory of Computation by Junior (551 points)
reshown by | 134 views
0
OPTION D, I think.
0
i am getting

L = { $(b^{n}.a.b^{n}.a)^{m} \;| \; m\geqslant 0, \; n> 0$ }
0
Yes..i am getting it too

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,385 answers
198,547 comments
105,359 users