The Gateway to Computer Science Excellence
0 votes
55 views
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
in Theory of Computation by (195 points) | 55 views
+1

I think it will be the pda

0

Sir, this also can be pda of this??? @Prateek Raghuvanshi

0
Connecting state q1 with final state will take care when m=0..
0

@MiNiPanda if m>0 then it is correct right??

0

@arya_stark it is not correct because in language a's are double than b's ,so we have to take care of that ,see my dpda.

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,388 answers
198,576 comments
105,414 users