menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.4k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Hi, could you please update us about the Mock...
Hi, just curious if there are any updates...
thanks himanshu2021. But I am asking for the page...
But IISc hasn't mentioned TCS as one of their...
@kiioo https://gateoverflow.in/blog/11426/jest-20...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
MadeEasy Test Series: Theory Of Computation - Regular Languages
0
votes
599
views
Which of the following is Regular?
theory-of-computation
regular-languages
made-easy-test-series
asked
Nov 4, 2018
in
Theory of Computation
Gupta731
edited
Mar 3, 2019
by
Aditi Singh
599
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
Dharmendra Verma
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
4
votes
3
answers
1
754
views
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \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
Hirak
754
views
made-easy-test-series
theory-of-computation
regular-languages
0
votes
1
answer
2
140
views
MadeEasy Test Series: Theory Of Computation - Regular Languages
Can someone explain this problem?
Can someone explain this problem?
asked
Sep 5, 2018
in
Theory of Computation
Kalpataru Bose
140
views
made-easy-test-series
regular-languages
theory-of-computation
2
votes
0
answers
3
205
views
MadeEasy Test Series 2018: Theory Of Computation - Regular Languages
asked
Jan 4, 2018
in
Theory of Computation
Rishi yadav
205
views
made-easy-test-series
theory-of-computation
regular-languages
7
votes
4
answers
4
1.8k
views
MadeEasy Test Series: Theory Of Computation - Regular Languages
Which of the following is a non-regular 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
Which of the following is a non-regular 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
ARUN KUMAR 3
1.8k
views
made-easy-test-series
theory-of-computation
regular-languages
...