RACSO
DFA
CFG
Operations:
Reg
,
CF
PDA
Reductions:
K
,
WP
,
CFG
,
NP
,
SAT
ANTLR:
lexical
,
syntactic
Exams
log in
,
register
,
become guest
This site uses cookies only for the purpose of identifying user sessions. This is required to properly register actions.
Exercise
‹
5
›
:
Deterministic uniquely-accepting PDA for
{
w
∈
{
a
,
b
}
∗
∣
∣
w
∣
a
≥
∣
w
∣
b
}
\{ w \in \{a,b\}^* \mid |w|_a\geq|w|_b \}
{
w
∈
{
a
,
b
}
∗
∣
∣
w
∣
a
≥
∣
w
∣
b
}
Write a
deterministic uniquely-accepting
PDA recognizing the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
such that the number of occurrences of
a
a
a
is greater than or equal to the number of occurrences of
b
b
b
.
Authors:
Guillem Godoy /
Documentation:
// Write your PDA here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.