Codex Wiki
OurBigBook.com
Site
Source code
Extended transition function of a deterministic finite automaton
(
δ
)
Home
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
Deterministic finite automaton
OurBigBook.com
Words: 18
For a transition function
δ
:
Q
×
Σ
→
Q
, define
δ
(
q
,
ε
)
=
q
,
δ
(
q
,
w
a
)
=
δ
(
δ
(
q
,
w
)
,
a
)
.
(34)
The accepted language is
{
w
:
δ
(
q
0
,
w
)
∈
F
}
.
Ancestors
(6)
Deterministic finite automaton
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Solution
Solution