- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

The ε closure(P) is a set of states which are reachable from state P on ε-transitions.

The epsilon closure is as mentioned below −

- ε-closure (P) = P, where P ∈ Q
- If there exists ε-closure (P) = {q} and 𝛿(q, ε) =r then, ε-closure (P) = {q, r}

Find ε-closure for the following Non-deterministic finite automata (NFA) with epsilon.

ε-closure (q0)= {q0,q1,q2}

self state+ ε-reachable states.

ε-closure (q1)= { q1,q2}

q1 is self-state and q2 is a state obtained from q1 with epsilon input.

ε-closure (q2)= {q2}

Lets us consider an example to understand more clear about epsilon closure −

Problem − find the number of epsilon closure in the below diagram?

**Solution −**

The epsilon closure set of f2 consist of the elements − {f2, f3}. Therefore, the count of the element in the closure set is 2.

- Related Questions & Answers
- How to convert NFA with epsilon to DFA in TOC?
- What is an acceptance of language by NFA with Epsilon?
- Explain the Closure Under Kleene Star of CFL in TOC?
- What is Decidability in TOC?
- What is JavaScript closure? Explain with examples.
- What is Inductive Hypothesis in TOC?
- What is unambiguous grammar in TOC?
- What is NP-completeness in TOC?
- What is Turing Machine in TOC?
- What is a Derivation tree in TOC?
- What is a Moore Machine in TOC?
- What is a mealy machine in TOC?
- What is the decision problem in TOC?
- What is the Halting Problem in TOC?
- What is Linear bounded automata in TOC?

Advertisements