Standard

Boolean Algebras of Regular Languages. / Konovalov, A. S.; Selivanov, V. L.

In: Algebra and Logic, Vol. 52, No. 6, 01.01.2014, p. 448-470.

Research output: Contribution to journal › Article › peer-review

Harvard

Konovalov, AS & Selivanov, VL 2014, 'Boolean Algebras of Regular Languages', Algebra and Logic, vol. 52, no. 6, pp. 448-470. https://doi.org/10.1007/s10469-014-9260-2

APA

Konovalov, A. S., & Selivanov, V. L. (2014). Boolean Algebras of Regular Languages. Algebra and Logic, 52(6), 448-470. https://doi.org/10.1007/s10469-014-9260-2

Vancouver

Konovalov AS, Selivanov VL. Boolean Algebras of Regular Languages. Algebra and Logic. 2014 Jan 1;52(6):448-470. https://doi.org/10.1007/s10469-014-9260-2

Author

Konovalov, A. S. ; Selivanov, V. L. / Boolean Algebras of Regular Languages. In: Algebra and Logic. 2014 ; Vol. 52, No. 6. pp. 448-470.

BibTeX

@article{8d36585657954837bc1627d4c6fed097,
title = "Boolean Algebras of Regular Languages",
abstract = "Some of the Boolean algebras of regular languages of finite and infinite words are characterized up to isomorphism. It is shown that classes of regular languages related to such characterizations are decidable. {\textcopyright} 2014 Springer Science+Business Media New York.",
keywords = "ω-aperiodic language, ω-regular language, aperiodic language, Boolean algebra, d-quasiaperiodic language, Frechet ideal, quasiaperiodic language, regular language",
author = "Konovalov, {A. S.} and Selivanov, {V. L.}",
year = "2014",
month = jan,
day = "1",
doi = "10.1007/s10469-014-9260-2",
language = "English",
volume = "52",
pages = "448--470",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer Nature",
number = "6",

}

RIS

TY - JOUR

T1 - Boolean Algebras of Regular Languages

AU - Konovalov, A. S.

AU - Selivanov, V. L.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Some of the Boolean algebras of regular languages of finite and infinite words are characterized up to isomorphism. It is shown that classes of regular languages related to such characterizations are decidable. © 2014 Springer Science+Business Media New York.

AB - Some of the Boolean algebras of regular languages of finite and infinite words are characterized up to isomorphism. It is shown that classes of regular languages related to such characterizations are decidable. © 2014 Springer Science+Business Media New York.

KW - ω-aperiodic language

KW - ω-regular language

KW - aperiodic language

KW - Boolean algebra

KW - d-quasiaperiodic language

KW - Frechet ideal

KW - quasiaperiodic language

KW - regular language

UR - http://www.scopus.com/inward/record.url?scp=84897611058&partnerID=8YFLogxK

U2 - 10.1007/s10469-014-9260-2

DO - 10.1007/s10469-014-9260-2

M3 - Article

AN - SCOPUS:84897611058

VL - 52

SP - 448

EP - 470

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

IS - 6

ER -

ID: 127085382