For the language L = $\{\Sigma^*. 0 .\Sigma^5 . 1. \Sigma^*\}$
The NFA must have 8 states. Also, what would be the upper bound on the number of states of a DFA recognizing L.
For the language L = $\{\Sigma^*. 0 .\Sigma^5 . 1. \Sigma^*\}$
The NFA must have 8 states. Also, what would be the upper bound on the number of states of a DFA recognizing L.