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
Peter Linz Exercise 4.3
Ayush Upadhyaya
asked
in
Theory of Computation
Mar 15, 2017
retagged
Jun 4, 2017
by
Arjun
347
views
0
votes
0
votes
theory-of-computation
regular-language
Ayush Upadhyaya
asked
in
Theory of Computation
Mar 15, 2017
retagged
Jun 4, 2017
by
Arjun
by
Ayush Upadhyaya
347
views
answer
comment
Follow
share this
share
1 comment
by
utk0203
commented
Mar 15, 2017
reply
Follow
share this
Is it necessary to have always condition satisfying w1!= w2
It may or may not be so this is not regular
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
0
votes
0
votes
Not regular because we must compare atleast once ..(w1 with w2)...
Angkit
answered
Mar 15, 2017
by
Angkit
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
I think not regular because if w1!=w2 then either w1>w2 or w1<w2,in either case we need a comparison.
Purvi Agrawal
answered
Mar 15, 2017
by
Purvi Agrawal
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
226
views
Peter Linz Edition 4 Exercise 4.3 Question 26 (Page No. 124)
Let $L=$ {$a^nb^m:n\geq100,m\leq50$}. (a) Can you use the pumping lemma to show that L is regular? (b) Can you use the pumping lemma to show that L is not regular? Explain your answers.
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
by
Naveen Kumar 3
226
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
pumping-lemma
0
votes
0
votes
0
answers
2
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
154
views
Peter Linz Edition 4 Exercise 4.3 Question 25 (Page No. 124)
In the chain code language in Exercise 24, Section 3.1, let $L$ be the set of all $w ∈$ {$u,r,l,d$}$^*$ that describe rectangles. Show that $L$ is not a regular language.
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
by
Naveen Kumar 3
154
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
0
votes
0
votes
2
answers
3
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
397
views
Peter Linz Edition 4 Exercise 4.3 Question 24 (Page No. 124)
Suppose that we know that $L_1 ∪ L_2$ and $L_1$ are regular. Can we conclude from this that $L_2$ is regular?
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
by
Naveen Kumar 3
397
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
closure-property
0
votes
0
votes
2
answers
4
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
395
views
Peter Linz Edition 4 Exercise 4.3 Question 23 (Page No. 124)
Is the family of regular languages closed under infinite intersection?
Naveen Kumar 3
asked
in
Theory of Computation
Apr 12, 2019
by
Naveen Kumar 3
395
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
closure-property
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