86 search results - page 18 / 18 » Constructive Data Refinement in Typed Lambda Calculus |
143
click to vote
FASE
2006
Springer
15 years 7 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...