DOI

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.
Original languageEnglish
Pages (from-to)448-470
Number of pages23
JournalAlgebra and Logic
Volume52
Issue number6
DOIs
StatePublished - 1 Jan 2014

    Research areas

  • ω-aperiodic language, ω-regular language, aperiodic language, Boolean algebra, d-quasiaperiodic language, Frechet ideal, quasiaperiodic language, regular language

ID: 127085382