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
‹
12
›
:
Regular description for the language recognized by the NFA with set of states
{
0
,
1
,
2
,
3
,
4
,
5
}
\{0,1,2,3,4,5\}
{
0
,
1
,
2
,
3
,
4
,
5
}
,
initial state
0
0
0
, accepting state
4
4
4
, and transitions
δ
(
0
,
a
)
=
{
1
,
3
}
,
δ
(
0
,
b
)
=
4
,
δ
(
1
,
a
)
=
4
,
δ
(
1
,
b
)
=
{
2
,
3
}
,
δ
(
2
,
b
)
=
5
,
δ
(
3
,
a
)
=
2
,
δ
(
4
,
a
)
=
{
0
,
5
}
,
δ
(
4
,
b
)
=
{
0
,
2
}
,
δ
(
5
,
a
)
=
4
\delta(0,a)=\{1,3\},\;\delta(0,b)=4,\;\delta(1,a)=4,\;\delta(1,b)=\{2,3\},\;\delta(2,b)=5,\;\delta(3,a)=2,\;\delta(4,a)=\{0,5\},\;\delta(4,b)=\{0,2\},\;\delta(5,a)=4
δ
(
0
,
a
)
=
{
1
,
3
}
,
δ
(
0
,
b
)
=
4
,
δ
(
1
,
a
)
=
4
,
δ
(
1
,
b
)
=
{
2
,
3
}
,
δ
(
2
,
b
)
=
5
,
δ
(
3
,
a
)
=
2
,
δ
(
4
,
a
)
=
{
0
,
5
}
,
δ
(
4
,
b
)
=
{
0
,
2
}
,
δ
(
5
,
a
)
=
4
Give a regular description for the language recognized by the NFA represented
here
.
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
.
