RACSO
R
DFA
CFG
Operations:
Reg
,
CF
PDA
Reductions:
K
,
WP
,
CFG
,
NP
,
SAT
ANTLR:
lex
,
syn
Exams
log in
,
register
,
guest
This site uses cookies only for the purpose of identifying user sessions. This is required to properly register actions.
Exercise
‹
2
›
:
Deterministic uniquely-accepting PDA for
{
a
2
n
b
n
∣
n
≥
0
}
\{ a^{2n} b^n \mid n\geq 0 \}
{
a
2
n
b
n
∣
n
≥
0
}
Write a
deterministic uniquely-accepting
PDA recognizing the words of the form
a
2
n
b
n
a^{2n}b^n
a
2
n
b
n
, with
n
≥
0
n\geq 0
n
≥
0
.
Authors:
Guillem Godoy /
Documentation:
// Write your PDA here...
To be able to submit you need to
log in
,
register
, or
become a guest
.