An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(95)00199-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2113689473
@@ Property / OpenAlex ID: W2113689473 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of LR(k) parsers
@@ Property / cites work: Optimization of LR(k) parsers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3325046
@@ Property / cites work: Q3325046 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4045961
@@ Property / cites work: Q4045961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5551191
@@ Property / cites work: Q5551191 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3239817
@@ Property / cites work: Q3239817 / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of sublinear multiple keyword pattern matching algorithms
+Normal rank
@@ Property / cites work @@
+Q4692941
@@ Property / cites work: Q4692941 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126839033
@@ Property / Wikidata QID: Q126839033 / rank @@
+Normal rank