Regex is a family of languages each of which can have various implementations. You could have a regex implementation that instead uses mutually recursive functions etc.
What is true is that regexes are typically not turing complete and can be represented with simple state machines.
Regex is a family of languages each of which can have various implementations. You could have a regex implementation that instead uses mutually recursive functions etc.
What is true is that regexes are typically not turing complete and can be represented with simple state machines.