What is the search space of the regular inference?
- 1 January 1994
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- DATA-DRIVEN INDUCTIVE INFERENCE OF FINITE-STATE AUTOMATAInternational Journal of Pattern Recognition and Artificial Intelligence, 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
- Inference of k-testable languages in the strict sense and application to syntactic pattern recognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1990
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- The minimum consistent DFA problem cannot be approximated within and polynomialPublished by Association for Computing Machinery (ACM) ,1989
- Inference of Reversible LanguagesJournal of the ACM, 1982
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- Complexity of automaton identification from given dataInformation and Control, 1978
- Language identification in the limitInformation and Control, 1967