The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
MadeEasy Test Series: Theory Of Computation  Regular Languages
0
votes
163
views
Which of the following is Regular?
theoryofcomputation
regularlanguages
madeeasytestseries
asked
Nov 4, 2018
in
Theory of Computation
by
Gupta731
Active
edited
Mar 3, 2019
by
Aditi Singh

163
views
answer
comment
0
I think both are regular.What's the answer given?
0
Yes, both are Regular. There is no doubt with S2. But S1 is a bit confusing. Can you explain
0
it will produce a* i think
0
No idea
0
try taking examples.take value of m and n and see
0
S1 is string with any number of a's as you can represent any string of a in term of (a^n)^m where m is greater or equal than n.
0
How 2nd regular
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
S1. (a^n)^m can be written as (x)^m , m>=0 , which is regular.
S2. {a^nb^n / n>=1} it is CFL U {a^nb^m /n,m>=1}  it is regular.
So CFL U REG = REG and if it is regular then it will be CFL also.
answered
Nov 4, 2018
by
Dharmendra Verma
Active
comment
0
yeah, got it thanks
0
Explanation of the second one is not correct I guess.
For CFL and DCFL union with Regular language is closed.
CFL U RL = CFL
0
@Dhillu Yes correct
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
+3
votes
2
answers
1
MadeEasy Test Series: Theory Of Computation  Regular Languages
Consider the following statements: $S_1:\{(a^n)^mn\leq m\geq0\}$ $S_2:\{a^nb^nn\geq 1\} \cup \{a^nb^mn \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
asked
May 26, 2019
in
Theory of Computation
by
Hirak
Active

399
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
1
answer
2
MadeEasy Test Series: Theory Of Computation  Regular Languages
Can someone explain this problem?
asked
Sep 5, 2018
in
Theory of Computation
by
Kalpataru Bose

104
views
madeeasytestseries
regularlanguages
theoryofcomputation
+2
votes
0
answers
3
MadeEasy Test Series 2018: Theory Of Computation  Regular Languages
asked
Jan 4, 2018
in
Theory of Computation
by
Rishi yadav
Loyal

148
views
madeeasytestseries
theoryofcomputation
regularlanguages
+4
votes
4
answers
4
MadeEasy Test Series: Theory Of Computation  Regular Languages
Which of the following is a nonregular language? $L = \{wxwy \mid x,y,w \in (a+b)^+\}$ $L = \{xwyw \mid x,y,w \in (a+b)^+\}$ $L = \{wxyw \mid x,y,w \in (a+b)^+\}$ All of these
asked
Oct 17, 2016
in
Theory of Computation
by
ARUN KUMAR 3

1.2k
views
madeeasytestseries
theoryofcomputation
regularlanguages
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 Overflow Test Series  GATE CSE 2021
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
Subjects
All categories
General Aptitude
1.9k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
Verification will automatically expire after 400...
My Verification is showing as "Not verified Yet"...
The point calculation formula is changed. We were...
Keep doing problems. Chances are high that you...
The price will be the same till June 30th.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,215
questions
59,988
answers
201,185
comments
94,648
users