Inference of regular languages using state merging algorithms with search (Q2485087): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.patcog.2004.03.027
+Normal rank
@@ Property / OpenAlex ID @@
+W2015033692
@@ Property / OpenAlex ID: W2015033692 / rank @@
+Normal rank
@@ Property / cites work @@
+Occam's razor
@@ Property / cites work: Occam's razor / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of automaton identification from given data
+Normal rank
@@ Property / cites work @@
+The minimum consistent DFA problem cannot be approximated within any polynomial
+Normal rank
@@ Property / cites work @@
+On the complexity of minimum inference of regular sets
+Normal rank
@@ Property / cites work @@
+Learning regular sets from queries and counterexamples
+Normal rank
@@ Property / cites work @@
+System identification via state characterization
@@ Property / cites work: System identification via state characterization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3214824
@@ Property / cites work: Q3214824 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing Programs from Example Computations
@@ Property / cites work: Constructing Programs from Example Computations / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up the Synthesis of Programs from Traces
@@ Property / cites work: Speeding up the Synthesis of Programs from Traces / rank @@
+Normal rank
@@ Property / cites work @@
+Limits of exact algorithms for inference of minimum size finite state machines
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the inference of minimum size DFAs
+Normal rank
@@ Property / cites work @@
+Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
+Normal rank