3 ms·
I'm not a big fan of your explanation. To be more precise, true "regular expressions" are computationally equivalent to deterministic finite automata, which ind
by baddox 14y ago
I'm not a big fan of your explanation. To be more precise, true "regular expressions" are computationally equivalent to deterministic finite automata, which indeed can test an n-character string in O(n) time.
- deleted 14y ago[deleted]
- MileyCyrax 14y agoNFAs and DFAs both recognise the regular languages (and only them).