FlexFringe: modeling software behavior by learning probabilistic automata
From MaRDI portal
Cites work
- L^*-based learning of Markov decision processes
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
- A new look at the statistical model identification
- Exact DFA Identification Using SAT Solvers
- Formal language identification: query learning vs. gold-style learning
- Grammatical inference. Learning automata and grammars.
- Grammatical Inference: Algorithms and Applications
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Learning decision trees with flexible constraints and objectives using integer optimization
- Learning DFA representations of HTTP for protecting web applications
- Learning I/O automata
- Learning probabilistic automata: a study in state distinguishability
- Learning register automata with fresh value generation
- Learning register automata: from languages to program structures
- Learning regular sets from queries and counterexamples
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Mathematical optimization in classification and regression trees
- Mining specifications
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Optimal classification trees
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Spectral learning of weighted automata. A forward-backward perspective
- The Daikon system for dynamic detection of likely invariants
- The minimum consistent DFA problem cannot be approximated within any polynomial
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Using MDL for Grammar Induction
This page was built for publication: FlexFringe: modeling software behavior by learning probabilistic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913348)
