Fast brief practical DFA minimization (Q437674): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q45
@@ Property / Mathematics Subject Classification ID: 68Q45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P05
@@ Property / Mathematics Subject Classification ID: 68P05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6058197
@@ Property / zbMATH DE Number: 6058197 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+formal languages
@@ Property / zbMATH Keywords: formal languages / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+data structures
@@ Property / zbMATH Keywords: data structures / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+deterministic finite automata
@@ Property / zbMATH Keywords: deterministic finite automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+partition refinement
@@ Property / zbMATH Keywords: partition refinement / rank @@
+Normal rank
@@ 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/j.ipl.2011.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2038358049
@@ Property / OpenAlex ID: W2038358049 / 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 / cites work @@
+Re-describing an algorithm by Hopcroft
@@ Property / cites work: Re-describing an algorithm by Hopcroft / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Minimization of DFAs with Partial Transition Functions
+Normal rank
@@ Property / cites work @@
+Bisimilarity Minimization in O(m logn) Time
@@ Property / cites work: Bisimilarity Minimization in O(m logn) Time / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Bisimilarity Minimization in O(m log n) Time
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:437674