'How would you draw the NFA Language x*?
I am learning about automata, and we are now learning about NFAs, my professor told us to write an NFA for some language x*, as I understands * means that if you also have no input the language should be accepted, so when I made the NFA, in this case the start stage would also be the final stage my professor told me it is wrong because it would have any sense to make a automata that accepts on nothing, am I in the wrong here?
Solution 1:[1]
how about using quick-sort algorithm. And, I am not sure I got what your data looks like and what results you want to obtain. Maybe you could show us parts of your data frame.
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|---|
| Solution 1 | Yimin |