Ronald Oussoren <ronaldousso...@mac.com> added the comment:
https://math.stackexchange.com/questions/46975/how-to-prove-two-regular-expressions-are-identical-in-mathematical-way contains some references to proofs that checking if two regular expressions are equivalent is PSPACE-complete. Another answer in that question mentions that its at least exponential in both space and time. Either means that comparing two REs gets infeasible very fast, which makes this unsuited for an equality checking. I propose closing this issue. ---------- nosy: +ronaldoussoren _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue38660> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
