Exact DFA Identification Using SAT Solvers
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 66-79
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Matrix Interpretations for Proving Termination of Term RewritingJournal of Automated Reasoning, 2007
- Inferring Network Invariants Automatically2006
- Inference of regular languages using state merging algorithms with searchPattern Recognition, 2005
- A bibliographical study of grammatical inferencePattern Recognition, 2005
- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFALecture Notes in Computer Science, 2004
- Symbolic Model Checking without BDDs1999
- Combinational equivalence checking using satisfiability and recursive learning1999
- Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm1998
- INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME1992
- Complexity of automaton identification from given dataInformation and Control, 1978