Construction of PDA

Xylene asked Nov 24, 2016 • retagged Jul 4, 2017 by Arjun

476 views

0 votes

Can someone construct a PDA for aⁱb^jwhere i not equal to 3j+1 ? Is it NPDA or DPDA?

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

+ –

Xylene asked Nov 24, 2016 • retagged Jul 4, 2017 by Arjun

Xylene

476 views

See all

1 1 comment

Ashwin Kulkarni

commented Jan 1, 2018

It is DPDA.

Push, 4 a's instead for 1 a, and try to 4 b's for each b. if at last a's or b's will be remain then accepted.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

2 answers

Rakesh K asked Nov 18, 2016

1,577 views

PDA construction
Is the following language context free L = {$0^{i}1^{j}, i=2j+1$} How can PDA be designed for this language?

Is the following language context freeL = {$0^{i}1^{j}, i=2j+1$}How can PDA be designed for this language?

Rakesh K

1.6k views

Rakesh K asked Nov 18, 2016

Theory of Computation
pushdown-automata
context-free-language

+ –

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

jaisyking asked Jan 12, 2023

193 views

Context Free Languages(CFG) Push Down Anutomata(PDA)
PDA for $a^i b^j | i \neq 2j+1$ ?

PDA for $a^i b^j | i \neq 2j+1$ ?

jaisyking

193 views

jaisyking asked Jan 12, 2023

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

+ –

1 votes

1 answer

Souvik33 asked Nov 26, 2022

436 views

Autometa | PDA
Consider the following Language: L= $a^{n}b^{n}c^{n}$ | $n \geq 0$ Consider the following Statement: A PDA can accept the given language. As we can insert 2 a’s for every entry of a, and pop one ‘a’ for every b and after all b’s, pop one ‘a’ for every entry of ‘c’ So the above language is a CFL. Prove the above statement WRONG

Consider the following Language:L= $a^{n}b^{n}c^{n}$ | $n \geq 0$Consider the following Statement:A PDA can accept the given language. As we can insert 2 a’s for every ...

Souvik33

436 views

Souvik33 asked Nov 26, 2022

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

+ –

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

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment