Tiong Seng Tay

Learn More
In inductive inference, a machine is given words of a language (a recursively enu-merable set in our setting) and the machine is said to identify the language if it correctly names the language. In this paper we study identifiability of classes of languages where the unions of up to a fixed number (n say) of languages from the class are provided as input.(More)
The first place to look for a given reference, given the author's name and apporximate time of publication is in Math Reviews on line at MathSciNet Both of these give you some free searches, but it is more convenient to work through a library work station or use, say, your institution's access, if it exists. Often, but not always, you can link from those(More)
  • 1