6533b870fe1ef96bd12cef68

RESEARCH PRODUCT

Unions of identifiable families of languages

Raimonds SimanovskisKalvis ApsitisRusins FreivaldsJuris Smotrovs

subject

Set (abstract data type)Discrete mathematicsIdentification (information)Limit (category theory)IdentifiabilityLanguage familyInductive reasoningBoolean satisfiability problemMathematical economicsSatisfiabilityMathematics

description

This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identification types are not closed under the set union, some of them still have features that resemble closedness. To formalize this, we generalize the notion of closedness. Then by establishing “how closed” these identification types are we solve the satisfiability problem.

yearjournalcountryeditionlanguage
1996-01-01
https://doi.org/10.1007/bfb0033341