DocumentCode
728973
Title
Star Height via Games
Author
Bojanczyk, Mikolaj
fYear
2015
fDate
6-10 July 2015
Firstpage
214
Lastpage
219
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 ω-regular winning condition.
Keywords
automata theory; game theory; Gale-Stewart game; automata theory; limitedness problem; star height problem; Automata; Complexity theory; Computer science; Games; Nickel; Polynomials; Radiation detectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on
Conference_Location
Kyoto
ISSN
1043-6871
Type
conf
DOI
10.1109/LICS.2015.29
Filename
7174883
Link To Document