Star Height via Games
classification
💻 cs.LO
cs.FL
keywords
problemheightstaralgorithmlimitednessreducesautomatacalled
read the original abstract
This paper proposes a new algorithm deciding the star height problem. As shown by Kirsten, the star height problem reduces to a problem concerning automata with counters, called limitedness. The new contribution is a different algorithm for the limitedness problem, which reduces it to solving a Gale-Stewart game with an {\omega}-regular winning condition.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.