Exact DFA Identification Using SAT Solvers
From MaRDI portal
Publication:3588365
DOI10.1007/978-3-642-15488-1_7zbMath1291.68192OpenAlexW2141811956MaRDI QIDQ3588365
Marijn J. H. Heule, Sicco Verwer
Publication date: 10 September 2010
Published in: Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15488-1_7
Related Items (17)
Certifying DFA bounds for recognition and separation ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas ⋮ Simulating circuit-level simplifications on CNF ⋮ Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3 ⋮ Enhancing active model learning with equivalence checking using simulation relations ⋮ Passive automata learning: DFAs and NFAs ⋮ Regular inference as vertex coloring ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Auction optimization using regression trees and linear models as integer programs ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT ⋮ Inducing finite state machines from training samples using ant colony optimization ⋮ A formal methods approach to predicting new features of the eukaryotic vesicle traffic system ⋮ 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 ⋮ Induction and Exploitation of Subgoal Automata for Reinforcement Learning
Uses Software
This page was built for publication: Exact DFA Identification Using SAT Solvers
