3 ms·
Actually they are exactly equivalent. See for example http://en.wikipedia.org/wiki/Regular_expression http://en.wikipedia.org/wiki/Regular_expression ("Regular
by batterseapower 16y ago
Actually they are exactly equivalent.
See for example http://en.wikipedia.org/wiki/Regular_expression http://en.wikipedia.org/wiki/Regular_expression ("Regular expressions in this sense can express the regular languages, exactly the class of languages accepted by deterministic finite automata.")