Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625): 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.1016/j.tcs.2004.08.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2018601197
@@ Property / OpenAlex ID: W2018601197 / 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 @@
+Queries and concept learning
@@ Property / cites work: Queries and concept learning / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4072875
@@ Property / cites work: Q4072875 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of deterministic top-down grammars
@@ Property / cites work: Properties of deterministic top-down grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Learning context-free grammars from structural data in polynomial time
+Normal rank
@@ Property / cites work @@
+Q2754024
@@ Property / cites work: Q2754024 / rank @@
+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