- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- 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 = (00)*1(11)*

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

ε-NFA is defined in five tuple representation

{Q, q0, Σ, δ, F}

Where,

δ − Q × (Σ∪ε)→2

^{Q}Q − Finite set of states

Σ − Finite set of the input symbol

q0 − Initial state

F − Final state

δ − Transition function

## NFA without ε transition

NFA also has five states same as DFA, but with different transition function, as shown follows −

$$\delta\colon\:Q\times\:\sum\longrightarrow\:2^{Q}$$

Where,

Q: Finite set of states

Σ: Finite set of the input symbol

- q0: Initial state
F: Final state

δ: Transition function

Let’s consider the given language L = (00)*1(11)*.

The given language is divided into three parts (00)*, 1 and (11)*. Let’s construct the transition diagram for each part and finally concatenate the three parts to get the final result.

**Step 1** − NFA with epsilon for (00)* is as follows −

**Step 2** − NFA with epsilon for (11)* is as follows −

**Step 3** − Concatenate first and second part with 1 in between, as follows −

- Related Articles
- Construct âˆˆ-NFA of Regular Language L = (0+1)*(00+ 11)
- Construct âˆˆ-NFA of Regular Language L = 0(0+1)*1
- Construct âˆˆ-NFA of Regular Language L = b + ba*
- Construct âˆˆ-NFA of Regular Language L = {ab,ba}
- Construct a âˆˆ-NFA for the language L = (a* + b*)
- Construct a Turing Machine for language L = {0n1n2n | nâ‰¥1}
- Construct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
- Construct a Turing Machine for language L = {wwr | w âˆˆ {0, 1}}
- Construct NFA for the following language and convert it into DFA using the algorithm - L = (aa+ (bb*)c*)
- Construct NFA with Epsilon moves for regular expression a+ba*.
- Construct a Turing Machine for language L = {ww | w âˆˆ {0,1}}
- Construct a TM for the language L= {ww : w âˆˆ {0,1}}
- Construct PDA for L = {0n1m2(n+m) | m,n >=1}
- Construct PDA for accepting L = {anb(2n) | n>=1} U {anbn | n>=1}
- Display hour in KK (00-11) format in Java