A complexity measure on Büchi automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We define a complexity measure on non-deterministic Büchi automata, based on the notion of the width of the skeleton tree introduced by Kä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üchi automaton of width k can be translated to a deterministic parity automaton of degree at most 2k+1.

Original languageAmerican English
Title of host publicationLanguage and Automata Theory and Applications - 10th International Conference, LATA 2016, Proceedings
EditorsBianca Truthe, Jan Janoušek, Adrian-Horia Dediu, Carlos Martín-Vide
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319299990
StatePublished - 1 Jan 2016
Externally publishedYes
Event10th International Conference on Language and Automata Theory and Applications, LATA 2016 - Prague, Czech Republic
Duration: 14 Mar 201618 Mar 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)


Conference10th International Conference on Language and Automata Theory and Applications, LATA 2016
Country/TerritoryCzech Republic


  • Automata and logic
  • Automata for system analysis and program verification
  • Classification of regular ω-languages

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'A complexity measure on Büchi automata'. Together they form a unique fingerprint.

Cite this