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
‹
26
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∀
x
,
y
,
z
:
(
(
w
=
x
y
z
∧
∣
y
∣
=
3
)
⇒
∣
y
∣
a
=
2
)
}
\{ w \in \{a,b\}^* \mid \forall x,y,z: ((w=xyz \wedge |y|=3) \Rightarrow |y|_a=2) \}
{
w
∈
{
a
,
b
}
∗
∣
∀
x
,
y
,
z
:
((
w
=
x
yz
∧
∣
y
∣
=
3
)
⇒
∣
y
∣
a
=
2
)}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
such that every subword with length
3
3
3
has exactly two
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
.