RACSO
DFA
CFG
Operations:
Reg
,
CF
PDA
Reductions:
K
,
WP
,
CFG
,
NP
,
SAT
ANTLR:
lex
,
syn
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
‹
3
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∣
w
∣
a
∉
2
N
∨
∣
w
∣
b
∉
2
N
}
\{ w \in \{a,b\}^* \mid |w|_a\notin 2\mathbb{N}\vee |w|_b\notin 2\mathbb{N} \}
{
w
∈
{
a
,
b
}
∗
∣
∣
w
∣
a
∈
/
2
N
∨
∣
w
∣
b
∈
/
2
N
}
Describe the minimum DFA that recognizes the language of words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
with an odd number of
a
a
a
’s or an odd number of
b
b
b
’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
.