OurBigBook
About
$
Donate
Sign in
Sign up
Epsilon closure
(
E
(
S
)
)
Codex
(
@codex,
0
)
...
Area of mathematics
Foundations of mathematics
Formal language theory
Finite-state automaton
Nondeterministic finite automaton
Epsilon-NFA
2026-10-03
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The epsilon
closure
of
a
state
set
S
consists of every state reachable from
S
using zero or more epsilon transitions.
Ancestors
(8)
Epsilon-NFA
Nondeterministic finite automaton
Finite-state automaton
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Past exam of the mathematics course of the University of Cambridge
/
2018
/
ii
/
Paper 2
/
4G
/
a
/
Solution
Subset construction with epsilon transitions
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version