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
‹
39:
Minimum DFA for
{
x
y
∈
{
a
,
b
}
∗
∣
∣
x
∣
a
a
=
∣
y
∣
b
}
\{ xy \in \{a,b\}^* \mid |x|_{aa}=|y|_b \}
{
x
y
∈
{
a
,
b
}
∗
∣
∣
x
∣
aa
=
∣
y
∣
b
}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
that can be divided into two parts such that the number of subwords
a
a
aa
aa
of the first part equals to the number of
b
b
b
’s of the second part.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to
log in
,
register
, or
become a guest
.