Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452): Difference between revisions

@@ Property / author @@
-Christof Löding
@@ Property / author: Christof Löding / rank @@
-Normal rank
@@ Property / author @@
+Christof Löding
@@ Property / author: Christof Löding / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-state \(\omega\)-languages
@@ Property / cites work: Finite-state \(\omega\)-languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055589
@@ Property / cites work: Q4055589 / rank @@
+Normal rank
@@ Property / cites work @@
+On ω-regular sets
@@ Property / cites work: On ω-regular sets / rank @@
+Normal rank
@@ Property / cites work @@
+On syntactic congruences for \(\omega\)-languages
@@ Property / cites work: On syntactic congruences for \(\omega\)-languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992743
@@ Property / cites work: Q3992743 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4045961
@@ Property / cites work: Q4045961 / rank @@
+Normal rank
@@ Property / cites work @@
+Describing an algorithm by Hopcroft
@@ Property / cites work: Describing an algorithm by Hopcroft / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(00)00183-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2116820075
@@ Property / OpenAlex ID: W2116820075 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1603452