Inference of regular languages using state merging algorithms with search
- 1 September 2005
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 38 (9) , 1457-1467
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- How considering incompatible state mergings may reduce the DFA induction search tree1998
- Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm1998
- A stochastic search approach to grammar induction1998
- The minimum consistent DFA problem cannot be approximated within any polynomialJournal of the ACM, 1993
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Occam's RazorInformation Processing Letters, 1987
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- Complexity of automaton identification from given dataInformation and Control, 1978
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysisArtificial Intelligence, 1977
- System identification via state characterizationAutomatica, 1972