Identification of birfsa languages. (Q2490821): 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.2006.01.029
+Normal rank
@@ Property / OpenAlex ID @@
+W2066160009
@@ Property / OpenAlex ID: W2066160009 / rank @@
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762501
@@ Property / cites work: Q2762501 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4440387
@@ Property / cites work: Q4440387 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning regular languages using RFSAs.
@@ Property / cites work: Learning regular languages using RFSAs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4473235
@@ Property / cites work: Q4473235 / rank @@
+Normal rank
@@ Property / cites work @@
+Language identification in the limit
@@ Property / cites work: Language identification in the limit / rank @@
+Normal rank
@@ Property / cites work @@
+Identification in the limit of categorial grammars
+Normal rank
@@ Property / cites work @@
+Q4223176
@@ Property / cites work: Q4223176 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal NFA and biRFSA Languages
@@ Property / cites work: Minimal NFA and biRFSA Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient learning of context-free grammars from positive structural examples
+Normal rank
@@ Property / cites work @@
+Bideterministic automata and minimal representations of regular languages
+Normal rank
@@ Property / cites work @@
+On polynomial-time learnability in the limit of strictly deterministic automata
+Normal rank