Finitely generated \(\omega\)-languages (Q1092671)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4020496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finitely generated \(\omega\)-languages |
scientific article; zbMATH DE number 4020496 |
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
