Finitely generated \(\omega\)-languages
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.
scientific article; zbMATH DE number 4020496