- 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

# Construct ∈-NFA of Regular Language L = {ab,ba}

The ε transitions in Non-deterministic finite automata (NFA) are used to move from one state to another without having any symbol from input set Σ

ε-NFA is defined in five tuple representation

{Q, q0, Σ, δ, F}

Where,

δ − Q × (Σ∪ε)→2Q

Q − Finite set of states

Σ − Finite set of the input symbol

q0 − Initial state

F − Final state

δ − Transition function

NFA and NFA with epsilon both are almost the same; the only difference is their transition function.

**NFA transition function** is as follows −

δ − Q X Σ→ 2^{Q}

**NFA with ε- transition functions** is as follows −

δ: Q × (Σ∪ε)→2^{Q}

**Construct NFA with epsilon for a given language L= {ab, ba}.**

Follow the steps given below −

**Step 1 **− NFA with epsilon for (a+b) is given below −

It accepts either a or b as an input, and both go to the final state.

**Step 2** − NFA with epsilon for ab is as follows −

Concatenating a and b with epsilon, and a must followed by b then only it can reach the final state.

**Step 3 **− NFA with epsilon for ba is as follows −

Concatenating b and a with epsilon, and b must follow by a then only it can reach the final state.

**Step 4** − Now the final NFA with epsilon for the language L={ab, ba}.

The language consists of strings ab or ba, it can be written as (ab + ba). So the final ε-NFA having two paths, one path is for ab and another path is for ba both goes to the final state.

In the above steps we individually construct the structures for ab and ba. Now, add those two structures to get our result.

- Related Questions & Answers
- Construct ∈-NFA of Regular Language L = b + ba*
- Construct ∈-NFA of Regular Language L = (00)*1(11)*
- Construct ∈-NFA of Regular Language L = 0(0+1)*1
- Construct ∈-NFA of Regular Language L = (0+1)*(00+ 11)
- Construct NFA with Epsilon moves for regular expression a+ba*.
- Construct a ∈-NFA for the language L = (a* + b*)
- Construct NFA for the following language and convert it into DFA using the algorithm - L = (aa+ (bb*)c*)
- Construct a Turing Machine for language L = {0n1n2n | n≥1}
- Construct a Turing Machine for language L = {ww | w ∈ {0,1}}
- Construct a TM for the language L= {ww : w ∈ {0,1}}
- Construct a Turing Machine for language L = {wwr | w ∈ {0, 1}}
- Construct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
- What is an acceptance of language by NFA with Epsilon?
- Explain the Star Height of Regular Expression and Regular Language
- What is the conversion of a regular expression to finite Automata (NFA)?