AI RESEARCH
The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
arXiv CS.LG
•
ArXi:2605.30389v1 Announce Type: cross Pattern languages are a classical model in formal language theory and algorithmic learning theory. This note formulates the problem of computing the inclusion depth of a pattern language: the length of the longest strict inclusion chain from the universal pattern language to the language generated by a given pattern. Inclusion depth captures the mind-change complexity of pattern identification from positive data.