Register

Peter Linz Exercise 4.3

• retagged by
345 views

2 Answers

0 votes
0 votes
Not regular because we must compare atleast once ..(w1 with w2)...
User Avatar
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.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Naveen Kumar 3 asked Apr 12, 2019
229 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.
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 y...
User Avatar
0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked 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.
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 languag...
User Avatar
0 votes
0 votes
2 answers
3
Naveen Kumar 3 asked Apr 12, 2019
391 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?
Suppose that we know that $L_1 ∪ L_2$ and $L_1$ are regular. Can we conclude from this that $L_2$ is regular?
User Avatar
Link Copied!