\textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
From MaRDI portal
Publication:479466
DOI10.1007/s10994-013-5409-9zbMath1317.68104OpenAlexW2019179799MaRDI QIDQ479466
Rémi Eyraud, Colin de la Higuera, Sicco Verwer
Publication date: 5 December 2014
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-013-5409-9
Related Items (1)
Uses Software
Cites Work
- On the computational complexity of approximating distributions by probabilistic automata
- Inference of finite automata using homing sequences
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- On the learnability of discrete distributions
- Sampling-Based Approaches to Calculating Marginal Densities
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference
- Exact DFA Identification Using SAT Solvers
- A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data
- Learning functions represented as multiplicity automata
- Learning Theory
- Learning Rational Stochastic Languages
- Computational Complexity
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Grammatical Inference: Algorithms and Applications
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- On Information and Sufficiency
- Machine Learning: ECML 2003
- Stochastic inference of regular tree languages
- Computational mechanics: pattern and prediction, structure and simplicity.
- Variational inference for Dirichlet process mixtures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
