Login
Register
@
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
Pda Automata
vijju532
asked
in
Theory of Computation
Jun 3, 2018
288
views
1
vote
1
vote
Why only stack data structure is used for implementing pushdown automata(pda) why not others ???
theory-of-computation
pushdown-automata
vijju532
asked
in
Theory of Computation
Jun 3, 2018
by
vijju532
288
views
answer
comment
Follow
share this
share
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
1
vote
1
vote
2
answers
1
shekhar chauhan
asked
in
Theory of Computation
Jun 6, 2016
916
views
Automata Language PDA
If a given CFL Language is L= {a^n b^n ;n>=0} then how can we determine the value of L^2 .Explain with an example .
shekhar chauhan
asked
in
Theory of Computation
Jun 6, 2016
by
shekhar chauhan
916
views
theory-of-computation
pushdown-automata
context-free-language
1
vote
1
vote
0
answers
2
alexmurugan
asked
in
Theory of Computation
Nov 3, 2023
338
views
Language to PDA
Design the Push down Automata for the language L={anbmc2nd3m,n,m>=1}.Check the acceptance string by both the empty stack and final state method.
alexmurugan
asked
in
Theory of Computation
Nov 3, 2023
by
alexmurugan
338
views
theory-of-computation
pushdown-automata
0
votes
0
votes
0
answers
3
jaisyking
asked
in
Theory of Computation
Jan 12, 2023
194
views
Context Free Languages(CFG) Push Down Anutomata(PDA)
PDA for $a^i b^j | i \neq 2j+1$ ?
jaisyking
asked
in
Theory of Computation
Jan 12, 2023
by
jaisyking
194
views
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language
1
vote
1
vote
1
answer
4
Souvik33
asked
in
Theory of Computation
Nov 26, 2022
426
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
Souvik33
asked
in
Theory of Computation
Nov 26, 2022
by
Souvik33
426
views
pushdown-automata
theory-of-computation
context-free-language
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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
