Neuroscience, Regular Expressions, Computer Science, Machine Learning.
producing a minimal DFA) is a hard problem even for approximate solutions, but it can often be done offline and then yields a faster automaton for matching the expressions. The analogy to natural language is but pure speculation at this point... it’s plausible to me that what’s hard for Turing