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 in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Identification of DFA: Data-dependent versus data-independent algorithmsPublished by Springer Nature ,1996
- What is the search space of the regular inference?Lecture Notes in Computer Science, 1994
- Random DFA's can be approximately learned from sparse uniform examplesPublished by Association for Computing Machinery (ACM) ,1992
- INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIMESeries in Machine Perception and Artificial Intelligence, 1992
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- Inference of Sequential Machines from Sample ComputationsIEEE Transactions on Computers, 1978