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
Self doubt Pushdown Automata
Mk Utkarsh
asked
in
Theory of Computation
Sep 20, 2018
edited
Sep 21, 2018
by
Mk Utkarsh
148
views
0
votes
0
votes
Is it required to initialize stack symbol in PDA?
If yes then does this PDA have valid transitions?
pushdown-automata
theory-of-computation
Mk Utkarsh
asked
in
Theory of Computation
Sep 20, 2018
edited
Sep 21, 2018
by
Mk Utkarsh
by
Mk Utkarsh
148
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
0
votes
0
votes
1
answer
1
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
66
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}
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
66
views
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
0
votes
0
votes
0
answers
2
Abhipsa
asked
in
Theory of Computation
Jan 22, 2019
203
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 ∑*
Abhipsa
asked
in
Theory of Computation
Jan 22, 2019
by
Abhipsa
203
views
pushdown-automata
theory-of-computation
0
votes
0
votes
1
answer
3
anonymous
asked
in
Theory of Computation
Jan 16, 2019
199
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
anonymous
asked
in
Theory of Computation
Jan 16, 2019
by
anonymous
199
views
pushdown-automata
theory-of-computation
context-free-language
0
votes
0
votes
0
answers
4
jatin khachane 1
asked
in
Theory of Computation
Dec 10, 2018
511
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$
jatin khachane 1
asked
in
Theory of Computation
Dec 10, 2018
by
jatin khachane 1
511
views
made-easy-test-series
theory-of-computation
pushdown-automata
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
the paper was easy to moderate, in this paper...
110
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
