Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries (Q3520065): 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-75225-7_23
+Normal rank
@@ Property / OpenAlex ID @@
+W1789613047
@@ Property / OpenAlex ID: W1789613047 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the number of queries needed to identify regular languages
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Learning regular sets from queries and counterexamples
+Normal rank
@@ Property / cites work @@
+Learning DFA from Correction and Equivalence Queries
+Normal rank
@@ Property / cites work @@
+Query learning of regular tree languages: How to avoid dead states
+Normal rank
@@ Property / cites work @@
+Language identification in the limit
@@ Property / cites work: Language identification in the limit / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4013526
@@ Property / cites work: Q4013526 / rank @@
+Normal rank
@@ Property / cites work @@
+Identification of pattern languages from examples and queries
+Normal rank
@@ Property / cites work @@
+Learning context-free grammars from structural data in polynomial time
+Normal rank
@@ Property / cites work @@
+A Characterization of the Language Classes Learnable with Correction Queries
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ Property / cites work @@
+Learning two-tape automata from queries and counterexamples
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3520065