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
‹
17
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∣
w
∣
a
b
a
=
0
∧
∣
w
∣
b
a
b
=
0
∧
∃
x
:
w
=
x
a
a
a
}
\{ w \in \{a,b\}^* \mid |w|_{aba}=0 \wedge |w|_{bab}=0 \wedge \exists x: w=xaaa \}
{
w
∈
{
a
,
b
}
∗
∣
∣
w
∣
aba
=
0
∧
∣
w
∣
bab
=
0
∧
∃
x
:
w
=
x
aaa
}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
that end in
a
a
a
aaa
aaa
, and do not contain
a
b
a
aba
aba
or
b
a
b
bab
bab
.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.