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
‹
36
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∃
x
,
y
,
z
:
(
w
=
x
y
z
∧
∣
y
∣
b
=
3
+
∣
y
∣
a
)
}
\{ w \in \{a,b\}^* \mid \exists x,y,z: (w=xyz \wedge |y|_b=3+|y|_a) \}
{
w
∈
{
a
,
b
}
∗
∣
∃
x
,
y
,
z
:
(
w
=
x
yz
∧
∣
y
∣
b
=
3
+
∣
y
∣
a
)}
Describe the minimum DFA that recognizes the set of words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
that have some subword with three more
b
b
b
’s than
a
a
a
’s.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.