login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019471 Maximum number of states needed to accept an n-th order approximation to a language over (0+1)^*, n=1..infinity. 0
2, 4, 7, 13, 21, 37 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 20:56 EDT 2019. Contains 325265 sequences. (Running on oeis4.)