Comment by high_5

9 hours ago

Yup, no regular expressions without his theory.

False, we owe them to Kleene, 1956.

A formal theory of finite automatons, both deterministic and non-deterministic, is due to Michael Rabin & Dana Scott, for which they received a Turing prize. 1959.