\textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
From MaRDI portal
Publication:479466
Recommendations
- Learning probability distributions generated by finite-state machines
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- On the computational complexity of approximating distributions by probabilistic automata
- Learning Theory
- scientific article; zbMATH DE number 5957212
Cites work
- A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Computational Complexity
- Computational mechanics: pattern and prediction, structure and simplicity.
- Exact DFA Identification Using SAT Solvers
- Grammatical inference. Learning automata and grammars.
- Grammatical Inference: Algorithms and Applications
- scientific article; zbMATH DE number 1670711 (Why is no real title available?)
- scientific article; zbMATH DE number 1670712 (Why is no real title available?)
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- scientific article; zbMATH DE number 3731374 (Why is no real title available?)
- scientific article; zbMATH DE number 42051 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 727576 (Why is no real title available?)
- scientific article; zbMATH DE number 1163157 (Why is no real title available?)
- scientific article; zbMATH DE number 2019596 (Why is no real title available?)
- scientific article; zbMATH DE number 2080668 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3402108 (Why is no real title available?)
- Improvement of the state merging rule on noisy data in probabilistic grammatical inference.
- Inference of finite automata using homing sequences
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning functions represented as multiplicity automata
- Learning Rational Stochastic Languages
- Learning Theory
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- On Information and Sufficiency
- On the computational complexity of approximating distributions by probabilistic automata
- On the learnability of discrete distributions
- Sampling-Based Approaches to Calculating Marginal Densities
- Stochastic inference of regular tree languages
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference
- Variational inference for Dirichlet process mixtures
Cited in
(4)- Discovering stochastic process models by reduction and abstraction
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- A comparison of collapsed Bayesian methods for probabilistic finite automata
- FlexFringe: modeling software behavior by learning probabilistic automata
This page was built for publication: \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479466)
