Theoretical computer science · Oct 6, 2026
Generalized star height at most three
Every regular language over a finite alphabet has a generalized regular expression with at most three nested Kleene stars, allowing union, concatenation and complement over the same alphabet. This establishes an absolute bound independent of automaton size, resolving the uniform-boundedness version of the generalized star-height problem.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model