Finitely generated \(\omega\)-languages (Q1092671)

From MaRDI portal
Revision as of 19:57, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finitely generated \(\omega\)-languages
scientific article

    Statements

    Finitely generated \(\omega\)-languages (English)
    0 references
    0 references
    0 references
    1986
    0 references
    Let \(R\subset X^*\) be a rational language. We prove that one can decide whether \(R^{\omega}\) is finitely generated, that is, whether \(R^{\omega}=F^{\omega}\) for some finite set F.
    0 references
    0 references