New answers tagged regular-expressions
0
votes
Formally Verify if a Sequence of Regex-Based Modifications is Idempotent
This is likely to be a very hard problem, so hard that I don't think you should expect a useful solution that can handle all possible regexes.
The extended regular expressions supported by Python's <...

D.W.♦
- 156k
2
votes
How does a regular expression match `.+x`?
This is probably the main difference between "regular expressions" as a formal language, and "regexes" as an implementation tool.
Extending a regular expression matching algorithm ...
Top 50 recent answers are included
Related Tags
regular-expressions × 829regular-languages × 397
finite-automata × 288
formal-languages × 219
automata × 185
formal-grammars × 45
context-free × 43
pumping-lemma × 35
algorithms × 32
strings × 18
parsers × 16
kleene-star × 16
compilers × 15
complexity-theory × 13
computability × 13
proof-techniques × 13
nondeterminism × 13
closure-properties × 11
simulation × 11
discrete-mathematics × 10
terminology × 9
turing-machines × 6
programming-languages × 6
theory × 6
reference-request × 5