scientific article
From MaRDI portal
Publication:3093192
zbMath1222.68094MaRDI QIDQ3093192
Franck Thollard, Alexander Clark
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v5/clark04a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (15)
Learning deterministic context free grammars: the Omphalos competition ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Efficiently identifying deterministic real-time automata from labeled data ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ Learning Probability Distributions Generated by Finite-State Machines ⋮ Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ Adaptively learning probabilistic deterministic automata from data streams ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ A comparison of collapsed Bayesian methods for probabilistic finite automata ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance ⋮ Weighted automata are compact and actively learnable ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
This page was built for publication:
