Pushdown automata

vivekpinto07 asked Jul 6, 2016 • recategorized Jul 2, 2022 by Lakshman Bhaiya

2,077 views

1 votes

For every pushdown automata,there exists an equivalent

A)Regular Language

B)Context sensitive language

C)Context free language

D)Recursively Enumerable language.

Theory of Computation
theory-of-computation
pushdown-automata

+ –

vivekpinto07 asked Jul 6, 2016 • recategorized Jul 2, 2022 by Lakshman Bhaiya

vivekpinto07

2.1k views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Best answer

5 votes

Pushdown Automata are equivalent to Context free Grammar .For every Context free grammar there exist a Push down automata such that the language generated by the grammar is identical with the Language generated by the automata.

shekhar chauhan answered Jul 6, 2016 • selected Jul 7, 2016 by srestha

shekhar chauhan

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

M_Umair_Khan42900 asked Dec 29, 2022

299 views

Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}

Construct pushdown automata that recognize the following language.L= (a²ⁿ b³ⁿ | n ≥ 0}

M_Umair_Khan42900

299 views

M_Umair_Khan42900 asked Dec 29, 2022

Theory of Computation
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata

+ –

0 votes

0 answers

Abhipsa asked Jan 22, 2019

336 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 a...

Abhipsa

336 views

Abhipsa asked Jan 22, 2019

Theory of Computation
pushdown-automata
theory-of-computation

+ –

0 votes

1 answer

anonymous asked Jan 16, 2019

257 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” ...

anonymous

257 views

anonymous asked Jan 16, 2019

Theory of Computation
pushdown-automata
theory-of-computation
context-free-language

+ –

0 votes

0 answers

jatin khachane 1 asked Dec 10, 2018

918 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 ...

jatin khachane 1

918 views

jatin khachane 1 asked Dec 10, 2018

Theory of Computation
made-easy-test-series
theory-of-computation
pushdown-automata

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0