scientific article; zbMATH DE number 5957212
From MaRDI portal
Publication:3093192
Recommendations
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Algorithmic Learning Theory
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Learning probabilistic automata: a study in state distinguishability
- On the learnability and usage of acyclic probabilistic finite automata
- Algorithmic Learning Theory
- Learning deterministic probabilistic automata from a model checking perspective
- Learning Theory
- scientific article; zbMATH DE number 2019596
- A lower bound for learning distributions generated by probabilistic automata
Cited in
(33)- Learning probabilistic automata and Markov chains via queries
- On the learnability and usage of acyclic probabilistic finite automata
- Characterizing PAC-learnability of semilinear sets
- Efficient learning of typical finite automata from random walks
- Learning deterministic probabilistic automata from a model checking perspective
- Learning probabilistic automata: a study in state distinguishability
- Fundamental results for learning deterministic extended finite state machines from queries
- Weighted automata are compact and actively learnable
- Learning deterministic context free grammars: the Omphalos competition
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Learning a Random DFA from Uniform Strings and State Information
- Efficiency in the identification in the limit learning paradigm
- Learning probability distributions generated by finite-state machines
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
- Languages as hyperplanes: grammatical inference with string kernels
- Efficiently identifying deterministic real-time automata from labeled data
- scientific article; zbMATH DE number 2019596 (Why is no real title available?)
- Learning Theory
- 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
- A lower bound for learning distributions generated by probabilistic automata
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Grammatical Inference: Algorithms and Applications
- Finite State Automata Resulting from Temporal Information Maximization and a Temporal Learning Rule
- Learning DFA from simple examples
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
- FlexFringe: modeling software behavior by learning probabilistic automata
- Learning commutative deterministic finite state automata in polynomial time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093192)
