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
How to construct a PDA for the language {a^mb^n:m<2n<3m}
Durgesh Singh
asked
in
Theory of Computation
Aug 11, 2017
1,175
views
1
vote
1
vote
theory-of-computation
context-free-language
pushdown-automata
Durgesh Singh
asked
in
Theory of Computation
Aug 11, 2017
by
Durgesh Singh
1.2k
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
3
votes
3
votes
1
answer
1
Don't you worry
asked
in
Theory of Computation
Jun 1, 2016
4,377
views
Is this language be accepted by 2 stack PDA L={a^n b^m c^n d^m / n>=m}
Don't you worry
asked
in
Theory of Computation
Jun 1, 2016
by
Don't you worry
4.4k
views
theory-of-computation
context-free-language
pushdown-automata
3
votes
3
votes
3
answers
2
sunil sarode
asked
in
Theory of Computation
Jul 11, 2017
10,565
views
Following language: L = {a^n b^n c^n d^n , n ≥ 1} ,How it is CSL and not CFL?
My understanding : We can create PDA as follows for every 'a' push operation and on 'b' pop operation and again on 'c' push operation and on seeing 'd' pop operation. please correct me , if i am wrong. I am sorry, if it is not important. Thanks lot :)
sunil sarode
asked
in
Theory of Computation
Jul 11, 2017
by
sunil sarode
10.6k
views
theory-of-computation
context-free-language
pushdown-automata
13
votes
13
votes
2
answers
3
tushark
asked
in
Theory of Computation
Nov 5, 2014
4,031
views
How to draw NPDA for language L = { a^i b^j c^m | m >= min( i,j) }
L1 = { a^i b^j c^m | m ≥ min(i,j) } L2 = { a^i b^j c^m | m ≥ max(i,j) } Which language is CFL ? ANS : L1 is CFL but L2 is NOT. My understanding : For Language L1 : ( Here I am interested in ... above NPDA is right , then we can construct NPDA for L2 also. But Answer part saying L2 is not CFL. So above NPDA is right or wrong ??
tushark
asked
in
Theory of Computation
Nov 5, 2014
by
tushark
4.0k
views
theory-of-computation
finite-automata
pushdown-automata
2
votes
2
votes
1
answer
4
Avdhesh Singh Rana
asked
in
Theory of Computation
Nov 11, 2017
2,235
views
a^n b^n c^m d^n e^n Is it CFG?
Avdhesh Singh Rana
asked
in
Theory of Computation
Nov 11, 2017
by
Avdhesh Singh Rana
2.2k
views
theory-of-computation
context-free-language
pushdown-automata
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
