\textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
type: Item
instance of: scholarly article
title: \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
zbMATH Open document ID: 1317.68104
author: Rémi Eyraud
author: Colin de la Higuera
author: Sicco Verwer
published in: Machine Learning
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 6377373
zbMATH Keywords: grammatical inference
zbMATH Keywords: probabilistic automata
zbMATH Keywords: hidden Markov models
zbMATH Keywords: programming competition
describes a project that uses: RFSA
MaRDI profile type: Publication
full work available at URL: s10994-013-5409-9
OpenAlex ID: W2019179799
cites work: On the computational complexity of approximating distributions by probabilistic automata
cites work: A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
cites work: Learning functions represented as multiplicity automata
cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries
cites work: Variational inference for Dirichlet process mixtures
cites work: Stochastic inference of regular tree languages
cites work: Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
cites work: Q3093192
cites work: Q4023085
cites work: Q3404129
cites work: Grammatical Inference: Algorithms and Applications
cites work: Learning Theory
cites work: Q2754000
cites work: Q4473564
cites work: Learning Rational Stochastic Languages
cites work: Q2754001
cites work: Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
cites work: Q4440388
cites work: Sampling-Based Approaches to Calculating Marginal Densities
cites work: Algorithmic Learning Theory
cites work: Machine Learning: ECML 2003
cites work: Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference
cites work: Exact DFA Identification Using SAT Solvers
cites work: Q5668011
cites work: On the learnability of discrete distributions
cites work: On Information and Sufficiency
cites work: Q4394647
cites work: Q3994887
cites work: Q5643915
cites work: Inference of finite automata using homing sequences
cites work: Computational Complexity
cites work: Computational mechanics: pattern and prediction, structure and simplicity.
cites work: A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data
cites work: Q3919111
cites work: Q4324427
DOI: 10.1007/S10994-013-5409-9
description: scientific article; zbMATH DE number 6377373