I'm assuming:

    1. Generate a list of suburbs names separated by |
    2. Simplify the regex:
    2.1. Convert to a NFA
    2.2. Turn it into a DFA
    2.3. Merge redundant states
    2.4. Turn it back into a regex

nfa? dfa?

Nondeterministic finite automaton and deterministic finite automaton. The theory behind state machines.

Thank you