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
‹
14
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∀
x
:
(
w
=
b
b
x
⇒
∣
x
∣
a
a
=
0
)
}
\{ w \in \{a,b\}^* \mid \forall x: (w=bbx \Rightarrow |x|_{aa}=0) \}
{
w
∈
{
a
,
b
}
∗
∣
∀
x
:
(
w
=
bb
x
⇒
∣
x
∣
aa
=
0
)}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
such that, if they start with
b
b
bb
bb
, then they do not contain
a
a
aa
aa
.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to
log in
,
register
, or
become a guest
.