We study the complexity of aperiodicity restricted to topological properties of regular ω-languages (i.e. properties closed under the Wadge equivalence on the Cantor space of ω-words) restricted to aperiodic sets. In particular, we show the -completeness of such problems for several usual deterministic and non-deterministic automata representations of regular ω-languages. © 2008 Springer-Verlag Berlin Heidelberg.
Original languageEnglish
Title of host publicationLogic and Theory of Algorithms (CiE 2008)
Pages533-543
Number of pages11
DOIs
StatePublished - 1 Jul 2008
EventComputability in europe-2008 -
Duration: 15 Jun 2008 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Nature
Volume5028
ISSN (Print)0302-9743

Conference

ConferenceComputability in europe-2008
Period15/06/08 → …

    Research areas

  • Aperiodic automaton, Deterministic Muller automaton, Monadic second-order formula, Nondeterministic Büchi automaton, Regular aperiodic ω-language, Wadge reducibility

ID: 127088014