{"id":"openai-math/Generalized-Star-Height-at-Most-Four","pdf":"https://github.com/openai/math/blob/main/preprints/Generalized-Star-Height-at-Most-Four-September-25-2026/Generalized-Star-Height-at-Most-Four-September-25-2026.pdf","url":"https://github.com/openai/math/tree/main/preprints/Generalized-Star-Height-at-Most-Four-September-25-2026","tags":["formal-languages","automata","regular-languages"],"score":0,"title":"Generalized Star Height at Most Four","domain":"Theoretical computer science","family":"134","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"cs.CC","summary":"Every regular language over a finite alphabet has generalized star height at most four over that same alphabet. We give a complete construction using an affine correction that hides one interval product, a finite clock, and several scales for moving boundaries through periodic words.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-09-25","reactions":{},"formalized":false,"family_title":"Generalized star height at most three"}