124 views
0 votes
0 votes
Let's assume we have a DPDA and NPDA .Now if we have a language suppose L which of the above can we use to find if L is regular or not? And why? I found its DPDA BT not NPDA.but what is the intuitive notion.can we use both ways of DPDA I.e using final state or by using empty stack to decide if L is regular or not?

Please log in or register to answer this question.

Related questions

3 votes
3 votes
0 answers
1
h4kr asked Nov 18, 2022
283 views
1 votes
1 votes
3 answers
2
Prince Sindhiya asked Jan 20, 2019
432 views
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4