A regular expression, without much rigor, is a very compact way of representing several different strings. Given a regular expression (regex), can I find out all the strings the regex can find?
In this post I just ramble a bit through some mathematician's definition of what a recursive function is...
