3 ms·
It isn't, at least in the proper sense. A regular language cannot be Turing complete.
by alwayslikethis 3y ago
It isn't, at least in the proper sense. A regular language cannot be Turing complete.
- sonicanatidae 3y agoIt's an easy mistake to make. They both are most often used incorrectly by people that poorly understand them.