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
‹
5
›
:
Regular description for
{
w
∈
{
a
,
b
}
∗
∣
∃
w
1
,
w
2
:
(
w
=
w
1
a
w
2
∧
∣
w
2
∣
=
5
)
∧
∣
w
∣
b
b
b
>
0
}
\{ w \in \{a,b\}^* \mid \exists w_1,w_2: (w=w_1aw_2\;\wedge\;|w_2|=5)\;\wedge\;|w|_{bbb}>0 \}
{
w
∈
{
a
,
b
}
∗
∣
∃
w
1
,
w
2
:
(
w
=
w
1
a
w
2
∧
∣
w
2
∣
=
5
)
∧
∣
w
∣
bbb
>
0
}
Give a regular description for the set of words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
such that there is an
a
a
a
at positions six from the end, and there is at least one occurrence of
b
b
b
bbb
bbb
.
Authors:
Guillem Godoy /
Documentation:
main { // Write here your regular description... }
To be able to submit you need to either
log in
,
register
, or
become a guest
.