Finitely generated \(\omega\)-languages
type: Item
instance of: scholarly article
title: Finitely generated \(\omega\)-languages
zbMATH Open document ID: 0627.68059
DOI: 10.1016/0020-0190(86)90131-6
author: E. Timmerman
author: Michel Latteux
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4020496
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90131-6
OpenAlex ID: W2020492103
cites work: Q3325067
cites work: Adherences of languages
cites work: Q5618355
cites work: Q4079524
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q4168081
description: scientific article; zbMATH DE number 4020496