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 8: Inference (Induction) of Tree Languages

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

      As we have seen in Chap. 5, a variety of inference algorithms for string languages have been developed. On the other hand, only a few grammatical inference algorithms in the case of tree structures have been proposed over the last forty years. As we will see, generic schemes which have been defined for the inferring of string languages are used for the constructing of (analogous) induction algorithms for tree languages…