Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (Q3528418): 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.1007/978-3-540-88009-7_15
+Normal rank
@@ Property / OpenAlex ID @@
+W1518563546
@@ Property / OpenAlex ID: W1518563546 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the number of queries needed to identify regular languages
+Normal rank
@@ Property / cites work @@
+Learning regular sets from queries and counterexamples
+Normal rank
@@ Property / cites work @@
+Q3093192
@@ Property / cites work: Q3093192 / rank @@
+Normal rank
@@ Property / cites work @@
+Teaching a smarter learner.
@@ Property / cites work: Teaching a smarter learner. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Characteristic sets for polynomial grammatical inference
+Normal rank
@@ Property / cites work @@
+Q3046706
@@ Property / cites work: Q3046706 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time learning of simple deterministic languages via queries and a representative sample
+Normal rank
@@ Property / cites work @@
+A hierarchy of language families learnable by regular language learning
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3528418