Let's say that we have a regex and an index
i. If we suppose that the set of strings that match our regex are sorted in a lexicographical order, how could we get the
i element of this list?
Edit : I added this simple example for more explanation:
In this case the ordered list of strings that this regex matches contains the following elements:
a aa ab ac b ba bb bc c ca cb cc
The 4th element, which is ac
ps: It's known that a given regex could match an infinite number of strings. This shouldn't have an impact on the process of extracting the element in the given finite