Finitely generated \(\omega\)-languages (Q1092671): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90131-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020492103 / rank | |||
Normal rank | |||
Revision as of 21:16, 19 March 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
