10. Write a program to find ε – closure of all states of any given NFA with ε transition.

Certainly! Here's a simple Python program to find the ε-closure of all states in a given NFA (Non-deterministic Finite Automaton) with ε-transitions. I'll provide an explanation for each line of the code:

```python

def epsilon_closure(nfa, state):

    closure = set()

    stack = [state]

    

    while stack:

        current_state = stack.pop()

        closure.add(current_state)

        

        if current_state in nfa and '' in nfa[current_state]:

            for epsilon_state in nfa[current_state]['']:

                if epsilon_state not in closure:

                    stack.append(epsilon_state)

    

    return closure

# Given NFA transitions with epsilon

nfa = {

    'q0': {'': ['q1', 'q2']},

    'q1': {'a': ['q3']},

    'q2': {'': ['q3']},

    'q3': {'b': ['q4']},

    'q4': {'': ['q5']}

}

for state in nfa:

    closure = epsilon_closure(nfa, state)

    print(f'Epsilon-closure of {state}: {closure}')

```

Explanation of each line:

1. `def epsilon_closure(nfa, state):`: Defines a function `epsilon_closure` that calculates the ε-closure of a given state in an NFA.

2. `closure = set()`: Initializes an empty set to store the ε-closure states.

3. `stack = [state]`: Initializes a stack with the initial state to process states iteratively.

4. `while stack:`: Enters a loop that continues until the stack is empty.

5. `current_state = stack.pop()`: Pops a state from the stack for processing.

6. `closure.add(current_state)`: Adds the current state to the ε-closure set.

7. `if current_state in nfa and '' in nfa[current_state]:`: Checks if the current state has ε-transitions.

8. `for epsilon_state in nfa[current_state]['']:`: Iterates through each state reachable by an ε-transition from the current state.

9. `if epsilon_state not in closure:`: Checks if the epsilon state is not already in the closure.

10. `stack.append(epsilon_state)`: Adds the epsilon state to the stack for further processing.

11. `return closure`: Returns the calculated ε-closure set for the input state.

13. `nfa = {...}`: Defines the NFA transitions with ε-transitions. Replace this with your NFA transitions.

15. `for state in nfa:`: Iterates through each state in the NFA.

16. `closure = epsilon_closure(nfa, state)`: Calls the `epsilon_closure` function to find the ε-closure of the current state.

17. `print(f'Epsilon-closure of {state}: {closure}')`: Prints the ε-closure of the current state.

Remember that this example assumes a specific structure for the NFA transitions. Modify the `nfa` dictionary to match your NFA's transitions and states.