====== 5. Regex to DFA conversion ======

==== 5.1. Nondeterministic Finite Automata ====

5.1.1. Consider the following NFA:

{{:lfa:lab03-nfa2.png|}}        

What are all reachable configurations from (0,abba) ?

5.1.2. What is the accepted language of the previous NFA? 

5.1.3. Write an NFA //without// $ \varepsilon$-transitions, which accepts the language $ L = \{abc,abd,aacd\}$ over the alphabet $ \Sigma = \{a,b,c,d\}$.

5.1.4. Consider the following NFA:

{{:lfa:lab02-nfa2.png|}}

What are all reachable configurations from $ (0,abbabbb)$?


==== 2. Regex to NFA =====
5.2.1. What language does $ (1 \cup \varepsilon)(00^*1)^*0^*$ generate?

5.2.2. Convert the previous regex to an NFA.


==== 3. The subset construction =====

5.3.1. Write the $ \varepsilon$-closure ($ E(q)$) for each state q in the NFA from exercise 5.1.4.

5.3.2. Convert the NFA from exercise 5.1.1 to a DFA.

5.3.3. Convert the NFA from exercise 5.1.4 to a DFA.

5.3.4. Convert the NFA from exercise 5.2.2 to a DFA.