Unsupervised automata learning via discrete optimization
From MaRDI portal
Cites work
- A new approach for active automata learning based on apartness
- Active learning for extended finite state machines
- Adaptive Model Checking
- Automata Learning through Counterexample Guided Abstraction Refinement
- Complexity of automaton identification from given data
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Domain-specific optimization in automata learning.
- Efficient algorithms for the inference of minimum size DFAs
- Exact DFA Identification Using SAT Solvers
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Grammatical inference. Learning automata and grammars.
- Grey-Box Learning of Register Automata
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 795584 (Why is no real title available?)
- Inference of finite automata using homing sequences
- Inferring Network Invariants Automatically
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning I/O automata
- Learning register automata: from languages to program structures
- Learning regular sets from queries and counterexamples
- Learning weighted automata
- Learning weighted automata over principal ideal domains
- MAT learning of universal automata
- On the learnability of infinitary regular sets
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Regular model checking using inference of regular languages
- The inference of tree languages from finite samples: An algebraic approach
This page was built for publication: Unsupervised automata learning via discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884752)
