The grammatical inference problem for the Szilard languages of linear grammars (Q917317): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(90)90074-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1975210121
@@ Property / OpenAlex ID: W1975210121 / rank @@
+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 @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Associate languages and derivational complexity of formal grammars and languages
+Normal rank
@@ Property / cites work @@
+On derivation languages corresponding to context-free grammars
+Normal rank
@@ Property / cites work @@
+Learning context-free grammars from structural data in polynomial time
+Normal rank
@@ Property / cites work @@
+Grammatical inference for even linear languages based on control sets
+Normal rank
@@ Property / cites work @@
+Worst-case Analysis of Set Union Algorithms
@@ Property / cites work: Worst-case Analysis of Set Union Algorithms / rank @@
+Normal rank