Finitely generated \(\omega\)-languages (Q1092671): Difference between revisions

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

Mathematics Subject Classification ID

68Q45

0 references

zbMATH DE Number

4020496

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(86)90131-6

0 references

0 references

0 references

Adherences of languages

0 references

Q5618355

0 references

Q4079524

0 references

Testing and generating infinite sequences by a finite automaton

0 references

Q4168081

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1092671

@@ Property / cites work @@
+Q3325067
@@ Property / cites work: Q3325067 / rank @@
+Normal rank
@@ Property / cites work @@
+Adherences of languages
@@ Property / cites work: Adherences of languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5618355
@@ Property / cites work: Q5618355 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+Q4168081
@@ Property / cites work: Q4168081 / rank @@
+Normal rank