Learning deterministic context free grammars: the Omphalos competition (Q2384127): Difference between revisions

@@ Property / DOI @@
-.1007/s10994-006-9592-9
@@ Property / DOI: 10.1007/s10994-006-9592-9 / rank @@
-Normal rank
@@ 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/s10994-006-9592-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2018647136
@@ Property / OpenAlex ID: W2018647136 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of approximating distributions by probabilistic automata
+Normal rank
@@ Property / cites work @@
+Q4471977
@@ Property / cites work: Q4471977 / rank @@
+Normal rank
@@ Property / cites work @@
+NTS languages are deterministic and congruential
@@ Property / cites work: NTS languages are deterministic and congruential / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846257
@@ Property / cites work: Q4846257 / rank @@
+Normal rank
@@ Property / cites work @@
+NTS grammars and Church-Rosser systems
@@ Property / cites work: NTS grammars and Church-Rosser systems / rank @@
+Normal rank
@@ Property / cites work @@
+Learning deterministic regular grammars from stochastic samples in polynomial time
+Normal rank
@@ Property / cites work @@
+Q3093192
@@ Property / cites work: Q3093192 / rank @@
+Normal rank
@@ Property / cites work @@
+Grammatical Inference: Algorithms and Applications
+Normal rank
@@ Property / cites work @@
+Grammatical Inference: Algorithms and Applications
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptographic limitations on learning Boolean formulae and finite automata
+Normal rank
@@ Property / cites work @@
+Evolutionary induction of stochastic context free grammars
+Normal rank
@@ Property / cites work @@
+Church-Rosser Thue systems and formal languages
@@ Property / cites work: Church-Rosser Thue systems and formal languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4386970
@@ Property / cites work: Q4386970 / rank @@
+Normal rank
@@ Property / cites work @@
+On the learnability and usage of acyclic probabilistic finite automata
+Normal rank
@@ Property / cites work @@
+Efficient learning of context-free grammars from positive structural examples
+Normal rank
@@ Property / cites work @@
+Grammatical Inference: Algorithms and Applications
+Normal rank
@@ Property / cites work @@
+Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
+Normal rank
@@ Property / DOI @@
+.1007/S10994-006-9592-9
@@ Property / DOI: 10.1007/S10994-006-9592-9 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2384127