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
Theory of computation
Mudita
asked
in
Theory of Computation
Aug 31, 2018
175
views
1
vote
1
vote
Is the following language regular?
theory-of-computation
Mudita
asked
in
Theory of Computation
Aug 31, 2018
by
Mudita
175
views
answer
comment
Follow
share this
share
4 Comments
Show 2 previous comments
by
Shaik Masthan
commented
Aug 31, 2018
reply
Follow
share this
@goxul
did you mean it can be CFL?
0
0
by
Verma Ashish
commented
Aug 31, 2018
reply
Follow
share this
is it CFL??
I think no dpda or npda possible.
0
0
by
goxul
commented
Aug 31, 2018
reply
Follow
share this
No, I meant that it cannot be a DCFL, as it cannot be done by a DPDA.
I think it cannot be done using a PDA either, although I am not sure.
0
0
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
0
answers
1
Souvik33
asked
in
Theory of Computation
Jan 7
195
views
Theory Of Computation | Minimum Pumping Length | MPL
MSQ Consider the following languages and their MPL (Minimum Pumping Length) Which among these are TRUE: L1 = aa(b)* :: MPL(L1) = 3 L2 = aa(aa)* :: MPL(L2) = 2 L2 = aa(aa)* :: MPL(L2) = 3 L2 = aa(aa)* :: MPL(L2) = 4 L3 = aa(ab)* :: MPL(L3) = 4 L4 = aa(b)* + aad(c)* :: MPL(L4) = 4
Souvik33
asked
in
Theory of Computation
Jan 7
by
Souvik33
195
views
theory-of-computation
pumping-lemma
0
votes
0
votes
1
answer
2
Souvik33
asked
in
Theory of Computation
Dec 27, 2022
134
views
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
Souvik33
asked
in
Theory of Computation
Dec 27, 2022
by
Souvik33
134
views
theory-of-computation
finite-automata
regular-language
made-easy-test-series
0
votes
0
votes
2
answers
3
Souvik33
asked
in
Theory of Computation
Dec 12, 2022
162
views
Theory of Computation | Automata
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSL TRUE FALSE
Souvik33
asked
in
Theory of Computation
Dec 12, 2022
by
Souvik33
162
views
theory-of-computation
context-sensitive
0
votes
0
votes
0
answers
4
Shreya2002
asked
in
Theory of Computation
Dec 2, 2022
118
views
Made easy Theory of Computation
Which of them are not regular- (a) L={a^m b^n | n>=2023, m<=2023} (b) L={a^n b^m c^l | n=2023, m>2023, l>m} according made easy (b) is the answer but can we do like this- Let L1= {a^n |n=2023} ... ) and so L2 is regular L=L1.L2 (regular lang are closed under concatenation) therefore L is regular.this makes option (b) regular is it right approach ?
Shreya2002
asked
in
Theory of Computation
Dec 2, 2022
by
Shreya2002
118
views
theory-of-computation
regular-language
closure-property
made-easy-test-series
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
@Aakash_Bhardwaj all the best bro . For your...
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy