Register

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

234 views

1 Answer

0 votes
0 votes
Since every regular language can have a deterministic FA, a DPDA can be designed similar to the DFA, such that nothing is pushed on stack for each symbol of input..
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 Jun 23, 2019
457 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.
Give an example of a deterministic context-free language whose reverse is not deterministic.
User Avatar
0 votes
0 votes
0 answers
2
Naveen Kumar 3 asked Jun 23, 2019
223 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.
Show that under the conditions of Exercise 16, $L_1 ∩ L_2$ is a deterministic context-free language.
User Avatar
0 votes
0 votes
1 answer
3
Naveen Kumar 3 asked Jun 23, 2019
343 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$ is deterministic context-free.
Show that if $L_1$ is deterministic context-free and $L_2$ is regular, then the language $L_1 ∪ L_2$ isdeterministic context-free.
User Avatar
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Jun 23, 2019
164 views
Peter Linz Edition 4 Exercise 7.3 Question 11 (Page No. 200)
Show that $L =$ {$w ∈$ {$a, b$}$^* : n_a (w) ≠ n_b (w)$} is a deterministic context-free language.
Show that $L =$ {$w ∈$ {$a, b$}$^* : n_a (w) ≠ n_b (w)$} is a deterministic context-free language.
User Avatar
Link Copied!