Exact DFA Identification Using SAT Solvers
From MaRDI portal
Recommendations
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- BFS-based symmetry breaking predicates for DFA identification
- Polynomial time identification of strict prefix deterministic finite state transducers
- Certifying DFA bounds for recognition and separation
- Minimising deterministic Büchi automata precisely using SAT solving
- Exact satisfiability of linear CNF formulas
- scientific article; zbMATH DE number 3868626
- Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
- Polynomial characteristic sets for \(DFA\) identification
Cited in
(31)- Inferring regular languages and \(\omega\)-languages
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- Certifying DFA bounds for recognition and separation
- A multi-parameter analysis of hard problems on deterministic finite automata
- Inducing finite state machines from training samples using ant colony optimization
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank
- BFS-based symmetry breaking predicates for DFA identification
- Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
- Simulating circuit-level simplifications on CNF
- A finite state intersection approach to propositional satisfiability
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Regular inference as vertex coloring
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
- Auction optimization using regression trees and linear models as integer programs
- Induction and exploitation of subgoal automata for reinforcement learning
- State identification and verification with satisfaction
- Enhancing active model learning with equivalence checking using simulation relations
- Passive automata learning: DFAs and NFAs
- Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach
- Compositional automata learning of synchronous systems
- Learning communicating state machines
- Joint learning of reward machines and policies in environments with partially known semantics
- Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Computing the base-\(b\) representation of quadratic irrationals using automata
- An active learning algorithm for bidirectional deterministic finite automata
- Unsupervised automata learning via discrete optimization
- FlexFringe: modeling software behavior by learning probabilistic automata
This page was built for publication: Exact DFA Identification Using SAT Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588365)
