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 machine
Nondeterministic finite automaton
Epsilon-NFA
Created
2026-10-03
Updated
2026-10-31
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 machine
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(7)
Epsilon transition
Past exam of the computer science course of the University of Oxford
/
2015
/
Models of computation
/
1
/
b
/
i
/
Solution
Past exam of the computer science course of the University of Oxford
/
2015
/
Models of computation
/
3
/
d
/
i
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2013
/
iii
/
Paper 20
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2018
/
ii
/
Paper 2
/
4G
/
a
/
Solution
Past exam of the year 1 of the computer science course of the University of Oxford
/
2005
/
Calculus, linear algebra, discrete mathematics, logic and proof, and models of computation
/
9
/
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