Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata

DOI10.1007/978-3-540-88009-7_13zbMath1177.68108OpenAlexW1576548369MaRDI QIDQ3528416

Ricard Gavaldà, Jorge E. Castro

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_13

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

Learning deterministic probabilistic automata from a model checking perspective ⋮ 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

This page was built for publication: Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata