A019471 Maximum number of states needed to accept an n-th order approximation to a language over (0+1)^*, n=1..infinity.

2, 4, 7, 13, 21, 37

Offset

0,1

Comments

Ranges of next terms are [ 68,69 ], [ 128,133 ], [ 247,255 ], [ 378,383 ].

References

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).

Links

Table of n, a(n) for n=0..5.

Crossrefs

Sequence in context: A026625 A026691 A018150 * A061257 A061255 A088111

Adjacent sequences: A019468 A019469 A019470 * A019472 A019473 A019474

Keyword

nonn

Author

Jeffrey Shallit

Status

approved