Register

Peter Linz Edition 4 Exercise 7.3 Question 11 (Page No. 200)

603 views
3 3 votes
Show that $L =$ {$w ∈$ {$a, b$}$^* : n_a (w) ≠ n_b (w)$} is a deterministic context-free language.

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · Peter Linz Edition 4...Next → · Peter Linz Edition 4...
← Previous in category · Peter Linz Edition 4...Next in category → · Peter Linz Edition 4...
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.0k
1.0k views
Naveen Kumar 3 asked Jun 23, 2019
1,045 views
Peter Linz Edition 4 Exercise 7.3 Question 18 (Page No. 200)
Give an example of a deterministic context-free language whose reverse is not deterministic.
0 0 votes
0 0 answers
359
359 views
Naveen Kumar 3 asked Jun 23, 2019
359 views
Peter Linz Edition 4 Exercise 7.3 Question 17 (Page No. 200)
Show that under the conditions of Exercise 16, $L_1 ∩ L_2$ is a deterministic context-free language.
0 0 votes
1 1 answer
626
626 views
Naveen Kumar 3 asked Jun 23, 2019
626 views
Peter Linz Edition 4 Exercise 7.3 Question 16 (Page No. 200)
Show that if $L_1$ is deterministic context-free and $L_2$ is regular, then the language $L_1 ∪ L_2$ isdeterministic context-free.
0 0 votes
1 1 answer
471
471 views
Naveen Kumar 3 asked Jun 23, 2019
471 views
Peter Linz Edition 4 Exercise 7.3 Question 15 (Page No. 200)
Show that every regular language is a deterministic context-free language.