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
‹
6
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∃
x
:
w
=
x
b
a
b
a
b
}
\{ w \in \{a,b\}^* \mid \exists x: w=xbabab \}
{
w
∈
{
a
,
b
}
∗
∣
∃
x
:
w
=
x
babab
}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
ending with
b
a
b
a
b
babab
babab
.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.