|
Boolean algebras of regular languages
A. S. Konovalov, V. L. Selivanov Ershov Institute of Informatics Systems, pr. Akad. Lavrent'eva 6, Novosibirsk, 630090, Russia
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.
Keywords:
Boolean algebra, Frechet ideal, regular language, aperiodic language, quasiaperiodic language, $d$-quasiaperiodic language, $\omega$-regular language, $\omega$-aperiodic language.
Received: 12.02.2013
Citation:
A. S. Konovalov, V. L. Selivanov, “Boolean algebras of regular languages”, Algebra Logika, 52:6 (2013), 676–711; Algebra and Logic, 52:6 (2014), 448–470
Linking options:
https://www.mathnet.ru/eng/al614 https://www.mathnet.ru/eng/al/v52/i6/p676
|
Statistics & downloads: |
Abstract page: | 253 | Full-text PDF : | 100 | References: | 51 | First page: | 15 |
|