Computing All ℓ-Cover Automata Fast (Q5200065): Difference between revisions

@@ Property / cites work @@
+Hyper-minimizing minimized deterministic finite state automata
+Normal rank
@@ Property / cites work @@
+AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+Minimal cover-automata for finite languages
@@ Property / cites work: Minimal cover-automata for finite languages / rank @@
+Normal rank
@@ Property / cites work @@
+Similarity relations and cover automata
@@ Property / cites work: Similarity relations and cover automata / rank @@
+Normal rank
@@ Property / cites work @@
+Hyper-minimisation Made Efficient
@@ Property / cites work: Hyper-minimisation Made Efficient / rank @@
+Normal rank
@@ Property / cites work @@
+On Minimising Automata with Errors
@@ Property / cites work: On Minimising Automata with Errors / 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 @@
+The structure and construction of taxonomic hierarchies
+Normal rank
@@ Property / cites work @@
+Hierarchical clustering schemes
@@ Property / cites work: Hierarchical clustering schemes / rank @@
+Normal rank
@@ Property / cites work @@
+A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA  FOR FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
+Normal rank