Register

Peter Linz Edition 4 Exercise 4.3 Question 13 (Page No. 123)

298 views

1 Answer

0 votes
0 votes

In both the given regular expressions, we need to count the number of a's and number of b's to check the given conditions, which cannot be implemented by a DFA/NFA. So they are not regular languages and the Union of these two languages is also not regular.

We need to use PDA.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

341
views
1 answers
1 votes
Naveen Kumar 3 asked Apr 12, 2019
341 views
Peter Linz Edition 4 Exercise 4.3 Question 16 (Page No. 123)
Is the following language regular? $L=$ {$w_1cw_2:w_1,w_2∈$ {$a,b$}$^*,w_1\neq w_2$}.
User Avatar
336
views
0 answers
1 votes
Naveen Kumar 3 asked Apr 12, 2019
336 views
Peter Linz Edition 4 Exercise 4.3 Question 15 (Page No. 123)
Consider the languages below. For each, make a conjecture whether or not it is regular. Thenprove your conjecture.(a) $L=$ {$a^nb^la^k:n+k+l \gt 5$}(b) $L=$ ... {$a^nb^l:n\geq 100,l\leq 100$}(g) $L=$ {$a^nb^l:|n-l|=2$}
User Avatar
257
views
0 answers
2 votes
Naveen Kumar 3 asked Apr 11, 2019
257 views
Peter Linz Edition 4 Exercise 4.3 Question 10 (Page No. 123)
Consider the language $L=$ {$a^n:n$ is not a perfect square}.(a) Show that this language is not regular by applying the pumping lemma directly.(b) Then show the same thing by using the closure properties of regular languages.
User Avatar
473
views
1 answers
0 votes
Naveen Kumar 3 asked Apr 11, 2019
473 views
Peter Linz Edition 4 Exercise 4.3 Question 14 (Page No. 123)
Prove or disprove the following statement: If $L_1$ and $L_2$ are non regular languages, then $L_1 ∪ L_2$ isalso non regular.
User Avatar
Link Copied!