4.1.1. Consider the following NFA:
What are all reachable configurations from (0,abba) ?
4.1.2. What is the accepted language of the previous NFA?
4.1.3. Write an NFA without $ \varepsilon$-transitions, which accepts the language $ L = \{abc,abd,aacd\}$ over the alphabet $ \Sigma = \{a,b,c,d\}$.
4.1.4. Consider the following NFA:
What are all reachable configurations from $ (0,abbabbb)$?
4.2.1. What language does $ (1 \cup \varepsilon)(00^*1)^*0^*$ generate?
4.2.2. Convert the previous regex to an NFA.
4.3.1. Write the $ \varepsilon$-closure ($ E(q)$) for each state q in the NFA from exercise 4.1.4.
4.3.2. Convert the NFA from exercise 4.1.1 to a DFA.
4.3.3. Convert the NFA from exercise 4.1.4 to a DFA.
4.3.4. Convert the NFA from exercise 4.2.2 to a DFA.