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
Regular Languages
nishant279
asked
in
Theory of Computation
Aug 21, 2017
379
views
0
votes
0
votes
Let A = {a, b}, L = {a^nb^n:n>=1} and R = A*, then the languages RUL and R are:
a) Regular, Regular
b) Regular, Not Regular
c) Not Regular, Regular
d) Not Regular, Not Regular
theory-of-computation
regular-language
nishant279
asked
in
Theory of Computation
Aug 21, 2017
by
nishant279
379
views
answer
comment
Follow
share this
share
3 Comments
by
joshi_nitish
commented
Aug 21, 2017
reply
Follow
share this
a) both will be regular.
0
0
by
Shubhanshu
commented
Aug 21, 2017
reply
Follow
share this
1st CFL union Regular -- Regular
2nd Regular.
0
0
by
Anjali Singh 1
commented
Aug 22, 2017
reply
Follow
share this
Option a
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
1
vote
1
vote
Best answer
R = {a, b}*
So it contains everything. And it is regular.
Now R U L is also R since whatever L be it will always be a subset of R(since it contains all possible strings).
So both the languages are same i.e. {a, b}* . Hence, both are regular.
And by the way, L is DCFL.
Rishabh Gupta 2
answered
Aug 21, 2017
selected
Aug 22, 2017
by
Praveen Saini
by
Rishabh Gupta 2
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
2
votes
2
votes
First of all L is DCFL. Not regular.
Now R is {a,b}* So regular.
So it contains everything.
Now everything Union Something = Everything.
Everything is Regular.
So RUL & R both are regular.
Ahwan
answered
Aug 21, 2017
by
Ahwan
comment
Follow
share this
1 comment
by
Sona Barman
commented
Dec 27, 2017
reply
Follow
share this
Good explanation in simple language and easy way.
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
practicalmetal
asked
in
Theory of Computation
Mar 25, 2023
377
views
Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none
practicalmetal
asked
in
Theory of Computation
Mar 25, 2023
by
practicalmetal
377
views
regular-language
theory-of-computation
finite-automata
1
vote
1
vote
1
answer
2
atulcse
asked
in
Theory of Computation
Jan 28, 2022
493
views
regular languages - TOC
Which of the following languages is/are regular?
atulcse
asked
in
Theory of Computation
Jan 28, 2022
by
atulcse
493
views
regular-language
theory-of-computation
made-easy-test-series
5
votes
5
votes
3
answers
3
Hirak
asked
in
Theory of Computation
May 25, 2019
1,840
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
Hirak
asked
in
Theory of Computation
May 25, 2019
by
Hirak
1.8k
views
made-easy-test-series
theory-of-computation
regular-language
0
votes
0
votes
1
answer
4
Anu Sreenivasan Unni
asked
in
Theory of Computation
Jan 25, 2019
639
views
MadeEasy Test Series 2019: Thoery of Computation - Regular Languages
Is the following language regular or not?
Anu Sreenivasan Unni
asked
in
Theory of Computation
Jan 25, 2019
by
Anu Sreenivasan Unni
639
views
theory-of-computation
regular-language
made-easy-test-series
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