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
‹
25
›
:
Minimum DFA for
{
w
∈
{
0
,
1
}
∗
∣
v
a
l
u
e
2
(
w
)
∈
5
N
}
\{ w \in \{0,1\}^* \mid \mathtt{value}_2(w)\in 5\mathbb{N} \}
{
w
∈
{
0
,
1
}
∗
∣
value
2
(
w
)
∈
5
N
}
Describe the minimum DFA that recognizes the words over
{
0
,
1
}
\{0,1\}
{
0
,
1
}
such that interpreted in binary represent a natural number multiple of
5
5
5
(in particular, the empty word represents
0
0
0
, which is multiple of
5
5
5
).
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to
log in
,
register
, or
become a guest
.