Language Identification in The Limit - Sufficient Conditions For Learnability - Finite Thickness

A class of languages has finite thickness if for every string s, there are only a finite number of languages in the class that are consistent with s. This is exactly Condition 3 in Angluin's paper. Angluin showed that if a class of recursive languages has finite thickness, then it is learnable in the limit.

A class with finite thickness certainly satisfies MEF-condition and MFF-condition; in other words, finite thickness implies M-finite thickness.

Read more about this topic:  Language Identification In The Limit, Sufficient Conditions For Learnability

Famous quotes containing the words finite and/or thickness:

    All finite things reveal infinitude:
    Theodore Roethke (1908–1963)

    For his teeth seem for laughing round an apple.
    There lurk no claws behind his fingers supple;
    And God will grow no talons at his heels,
    Nor antlers through the thickness of his curls.
    Wilfred Owen (1893–1918)