@inproceedings{6456f9fc6d3644768a01b38514b05cae,
title = "A complexity measure on B{\"u}chi automata",
abstract = "We define a complexity measure on non-deterministic B{\"u}chi automata, based on the notion of the width of the skeleton tree introduced by K{\"a}hler and Wilke. We show that the induced hierarchy tightly correlates to the Wagner Hierarchy, a corner stone in the theory of regular ω-languages that is derived from a complexity measure on deterministic Muller automata. The relation between the hierarchies entails, for instance, that a nondeterministic B{\"u}chi automaton of width k can be translated to a deterministic parity automaton of degree at most 2k+1.",
keywords = "Automata and logic, Automata for system analysis and program verification, Classification of regular ω-languages",
author = "Dana Fisman",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 10th International Conference on Language and Automata Theory and Applications, LATA 2016 ; Conference date: 14-03-2016 Through 18-03-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-30000-9_8",
language = "American English",
isbn = "9783319299990",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "102--113",
editor = "Bianca Truthe and Jan Janou{\v s}ek and Adrian-Horia Dediu and Carlos Mart{\'i}n-Vide",
booktitle = "Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Proceedings",
address = "Germany",
}