Register

dpda }} Linz7.3-4

752 views
0 votes
0 votes
DPDA for $L = \left \{ a^nb^n:n\geq 1 \right \} \cup\left \{ a \right \}$
User Avatar

2 Answers

Best answer
3 votes
3 votes

DPDA minimal.

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

Related questions

0 votes
0 votes
2 answers
1
dd asked Dec 7, 2016
484 views
dpda || Linz 7.3-2
DPDA for $L = \left \{ a^nb^m|m\geq n+2 \right \}$
DPDA for $L = \left \{ a^nb^m|m\geq n+2 \right \}$
User Avatar
1 votes
1 votes
0 answers
2
Matrix asked Jul 28, 2018
1,545 views
DPDA acceptance by empty stack
Is this approach of acceptance by empty stack correct ? I am confused because i have read that acceptance by empty stack may not be able to accept all regular languages.
Is this approach of acceptance by empty stack correct ?I am confused because i have read that acceptance by empty stack may not be able to accept all regular languages.
User Avatar
2 votes
2 votes
2 answers
3
rahul sharma 5 asked Nov 21, 2017
2,312 views
[TOC] Basic doubt in DPDA
Following is the PDA that accept equal number of a and b. How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choice.So how can i remove choice in this and make it deterministic?
Following is the PDA that accept equal number of a and b.How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choic...
User Avatar
3 votes
3 votes
1 answer
4
AskHerOut asked Oct 22, 2017
743 views
DPDA: One Liners
1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition? 2) Can a transition be performed without reading Stack symbol at all. Like $ a, λ/ λ$?
1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition?2) Can a transition be performed without reading Stack s...
User Avatar
Link Copied!