Abstract
In this paper, we deal with inductive inference for a class of recursive languages with a bounded number of mind changes. We introduce an n-bounded finite tell-tale and a pair of n-bounded finite tell-tales of a language, and present a necessary and sufficient condition for a class to be inferable with bounded mind changes, when the equivalence of any two languages in the class is effectively decidable. We also show that the inferability of a class from positive data strictly increases, when the allowed number of mind changes increases. In his previous paper, Mukouchi gave necessary and sufficient conditions for a class of recursive languages to be finitely identifiable, that is, to be inferable without any mind changes from positive or complete data. The results we present in this paper are natural extensions of the above results.KeywordsComplete DataFinite SubsetInductive InferencePositive DataBounded NumberThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
