|
%I #8 May 25 2013 01:21:27
%S 2,4,7,13,21,37
%N Maximum number of states needed to accept an n-th order approximation to a language over (0+1)^*, n=1..infinity.
%C Ranges of next terms are [ 68,69 ], [ 128,133 ], [ 247,255 ], [ 378,383 ].
%D J. Shallit and Y. Breitbart, Automaticity I: Properties of a measure of descriptional complexity, J. Comput. Sys. Sci. 53 (1996), 10-25 (esp. p. 19).
%K nonn
%O 0,1
%A _Jeffrey Shallit_
|
