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
‹
28
›
:
Minimum DFA for
{
w
∈
{
a
,
b
}
∗
∣
∀
x
,
y
:
(
(
w
=
x
y
∧
∣
y
∣
∉
2
N
)
⇒
∣
y
∣
b
=
1
+
∣
y
∣
a
)
}
\{ w \in \{a,b\}^* \mid \forall x,y: ((w=xy \wedge |y|\notin 2\mathbb{N}) \Rightarrow |y|_b=1+|y|_a) \}
{
w
∈
{
a
,
b
}
∗
∣
∀
x
,
y
:
((
w
=
x
y
∧
∣
y
∣
∈
/
2
N
)
⇒
∣
y
∣
b
=
1
+
∣
y
∣
a
)}
Describe the minimum DFA that recognizes the words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
whose suffixes of odd length have the propierty that their number of
b
b
b
’s equals their number of
a
a
a
’s plus
1
1
1
.
Authors:
Guillem Godoy /
Documentation:
// Write your DFA here...
To be able to submit you need to
log in
,
register
, or
become a guest
.