Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 1-12
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Identification of DFA: Data-dependent versus data-independent algorithms1996
- What is the search space of the regular inference?1994
- Efficient learning of typical finite automata from random walks1993
- Random DFA's can be approximately learned from sparse uniform examples1992
- INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME1992
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- Inference of Sequential Machines from Sample ComputationsIEEE Transactions on Computers, 1978