Finitely generated \(\omega\)-languages (Q1092671): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:21, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finitely generated \(\omega\)-languages |
scientific article |
Statements
Finitely generated \(\omega\)-languages (English)
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