3 ms·
If you can compile any string in the language to a DFA then it's equivalent in power to regular expressions.
by theseoafs 10y ago
If you can compile any string in the language to a DFA then it's equivalent in power to regular expressions.
3 ms·