Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Boolean algebras of regular ω-languages. / Selivanov, Victor; Konovalov, Anton.
Language and Automata Theory and Applications (LATA 2013). 2013. p. 504-515 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7810).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Boolean algebras of regular ω-languages
AU - Selivanov, Victor
AU - Konovalov, Anton
PY - 2013/1/1
Y1 - 2013/1/1
N2 - 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.
AB - 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.
KW - aperiodic ω-language
KW - Boolean algebra
KW - Fréchet ideal
KW - regular ω-language
UR - http://www.scopus.com/inward/record.url?scp=84875643225&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-37064-9_44
DO - 10.1007/978-3-642-37064-9_44
M3 - Conference contribution
AN - SCOPUS:84875643225
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 504
EP - 515
BT - Language and Automata Theory and Applications (LATA 2013)
T2 - Language and automata theory and applications
Y2 - 2 April 2013
ER -
ID: 127085638