World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Chapter 5: Inference (Induction) of String Languages

      https://doi.org/10.1142/9789813278479_0005Cited by:0 (Source: Crossref)
      Abstract:

      As we have discussed in Chap. 2 formal languages used in syntactic pattern recognition are represented with generative grammars and automata/parsers. The term grammatical inference (induction) is usually used in syntactic pattern recognition, although the induction schemes applied here can generate grammars or (the corresponding) automata. In this chapter introduced are the classic methods which belong to two approaches in the field of grammatical inference, text learning and informed learning