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
‹
9
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∀
x
,
y
:
(
w
=
x
a
y
⇒
∣
y
∣
b
∈
2
N
)
}
\{ w \in \{a,b\}^* \mid \forall x,y: (w=xay \Rightarrow |y|_b\in 2\mathbb{N}) \}
{
w
∈
{
a
,
b
}
∗
∣
∀
x
,
y
:
(
w
=
x
a
y
⇒
∣
y
∣
b
∈
2
N
)}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
such that to the right of each occurrence of
a
a
a
there is an even number of
b
b
b
’s.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to
log in
,
register
, or
become a guest
.