@

Dark Mode

Profile
Edit my Profile
Messages
My favorites

Register

Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams

Dark Mode

Push Down Automata

NIKU asked in Theory of Computation Sep 16, 2017

351 views

0 votes

0 votes

draw a deterministic PDA for

a^mbⁿ where, m = 2n+1

theory-of-computation
pushdown-automata
dpda

NIKU asked in Theory of Computation Sep 16, 2017

by NIKU

351 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

1 answer

1

Abhisek Tiwari 4 asked in Theory of Computation Nov 6, 2018

720 views

Push Down Automata
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .

Abhisek Tiwari 4 asked in Theory of Computation Nov 6, 2018

by Abhisek Tiwari 4

720 views

theory-of-computation
pushdown-automata
dpda
context-free-grammar

0 votes

0 votes

0 answers

2

shivangi5 asked in Theory of Computation Dec 1, 2017

466 views

Push Down Automata
Consider the following statement: S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property. Please explain as why this sentence is wrong....

shivangi5 asked in Theory of Computation Dec 1, 2017

466 views

theory-of-computation
pushdown-automata
dpda

1 vote

1 vote

1 answer

3

ashutoshaay26 asked in Theory of Computation Aug 15, 2017

1,143 views

Deterministic Push Down Automata
What is main difference between Deterministic Push down automata and simple Push down automata ?

ashutoshaay26 asked in Theory of Computation Aug 15, 2017

by ashutoshaay26

1.1k views

theory-of-computation
dpda
pushdown-automata

0 votes

0 votes

2 answers

4

Shamim Ahmed asked in Theory of Computation Oct 25, 2018

1,176 views

Pushdown Automata
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?

Shamim Ahmed asked in Theory of Computation Oct 25, 2018

by Shamim Ahmed

1.2k views

theory-of-computation
pushdown-automata
dpda

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Recent Posts

Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!