Star Height via Games
Logic in Computer Science
2017-08-14 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.1708.03603,
title = {Star Height via Games},
author = {Mikolaj Bojanczyk},
journal= {arXiv preprint arXiv:1708.03603},
year = {2017}
}