E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...