Generalized Star Height Problem: How OpenAI’s Two-Split Proof Sets a Three-Level Ceiling
A regular language can require arbitrarily deep repetition in an ordinary regular expression. Add complement, and OpenAI’s September 25, 2026 manuscript gives every regular language a three-level ceiling. Its answer to the Generalized Star Height Problem is a uniform upper bound over the original alphabet, not a proof that three levels are necessary. Whether one … Read more