menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

pushdown automata

0 votes
140 views
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
in Theory of Computation 140 views
1

I think it will be the pda

0

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


edited by
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.

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

0 votes
0 answers
1
71 views
Pushdown Automata
Let P be a non-deterministic pushdown automaton (NPDA) with exactly one state, q, and exactly one symbol, Z, in its stack alphabet. State q is both the starting as well as the accepting state of the PDA. The stack is initialized with one Z before the start of the operation ... L(P) is not necessarily ∑* Both L(P) and N(P) is necessarily ∑* Neither L(P) nor N(P) are necessarily ∑*
Let P be a non-deterministic pushdown automaton (NPDA) with exactly one state, q, and exactly one symbol, Z, in its stack alphabet. State q is both the starting as well as the accepting state of the PDA. The stack is initialized with one Z before the start of the operation of the PDA. ... but L(P) is not necessarily ∑* Both L(P) and N(P) is necessarily ∑* Neither L(P) nor N(P) are necessarily ∑*
asked Jan 22, 2019 in Theory of Computation Abhipsa 71 views
0 votes
0 answers
2
80 views
Building a pushdown automata that receives L*
given a pushdown automata that receives L by getting to an accepting state, how can a pushdown automata be built, so that it accepts L*? (might use a “double bottom” if needed)?? i don’t know how to solve it and would appreciate any kind of help! studying for exam and must learn how to solve it
given a pushdown automata that receives L by getting to an accepting state, how can a pushdown automata be built, so that it accepts L*? (might use a “double bottom” if needed)?? i don’t know how to solve it and would appreciate any kind of help! studying for exam and must learn how to solve it
asked Jan 16, 2019 in Theory of Computation anonymous 80 views
0 votes
2 answers
3
127 views
pushdown automata
What is the difference between DPDA which accept Language by the empty stack and the one which accepts by final state
What is the difference between DPDA which accept Language by the empty stack and the one which accepts by final state
asked Dec 16, 2018 in Theory of Computation saif 127 views
0 votes
0 answers
4
272 views
MadeEasy Subject Test 2019: Theory Of Computation - Pushdown Automata
Options: $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \} \cup \left \{ b^{n} | n\geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}\right )^{m}a | n,m \geq 0 \right \}$ $NONE$
Options: $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \} \cup \left \{ b^{n} | n\geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}\right )^{m}a | n,m \geq 0 \right \}$ $NONE$
asked Dec 10, 2018 in Theory of Computation jatin khachane 1 272 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...