Learning efficiency of very simple grammars from positive data (Q1017659): Difference between revisions

@@ Property / cites work @@
+Finding patterns common to a set of strings
@@ Property / cites work: Finding patterns common to a set of strings / rank @@
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3174138
@@ Property / cites work: Q3174138 / rank @@
+Normal rank
@@ Property / cites work @@
+Characteristic sets for polynomial grammatical inference
+Normal rank
@@ Property / cites work @@
+Polynomial-time inference of arbitrary pattern languages
+Normal rank
@@ Property / cites work @@
+Two decidability results for deterministic pushdown automata
+Normal rank
@@ Property / cites work @@
+Grammatical inference for even linear languages based on control sets
+Normal rank
@@ Property / cites work @@
+Grammatical Inference: Algorithms and Applications
+Normal rank
@@ Property / cites work @@
+Ignoring data may be the only way to learn efficiently
+Normal rank
@@ Property / cites work @@
+On polynomial-time learnability in the limit of strictly deterministic automata
+Normal rank
@@ Property / cites work @@
+Polynomial-time identification of very simple grammars from positive data.
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
+Normal rank
@@ Property / cites work @@
+Learning Efficiency of Very Simple Grammars from Positive Data
+Normal rank