Hacker News Reader

Russ Cox was involved in this, and also Go. There are important connections between them.

Russ cox also wrote re2, an awesome regex library using finite automata, and providing protection against regex match taking exponential time.

>regex library using finite automata

Ehh

>>regex library using finite automata >Ehh

By which you mean?

I remember learning RE in the context of finite automata so I'm gathering that they are questioning the novelty of that implementation strategy?

It's essential to it. Literally computer science 101

Exactly

Regex is equivalent to Finite Automata