We characterize up to isomorphism the Boolean algebras of regular ω-languages and of regular aperiodic ω-languages, and show decidability of classes of languages related to these characterizations. © 2013 Springer-Verlag Berlin Heidelberg.
Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications (LATA 2013)
Pages504-515
Number of pages12
DOIs
StatePublished - 1 Jan 2013
EventLanguage and automata theory and applications -
Duration: 2 Apr 2013 → …

Publication series

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

Conference

ConferenceLanguage and automata theory and applications
Period2/04/13 → …

    Research areas

  • aperiodic ω-language, Boolean algebra, Fréchet ideal, regular ω-language

ID: 127085638