Abstract

Abstract This paper surveys our studies on computational learning theory and computational discovery theory within the framework of elementary formal systems (EFSs for short), which are a kind of logic program on words, i.e., strings of characters. First we show that the EFSs are a good framework for discussing formal grammars and languages. Then we point out that EFSs work as a unifying framework for inductive inference of languages by discussing the model inference for EFSs in Shapiro’s sense.

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 call

Disclaimer: 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.