id:A019471 - OEIS Search Results

Search: id:A019471

Displaying 1-1 of 1 results found.

page 1

A019471

Maximum number of states needed to accept an n-th order approximation to a language over (0+1)^*, n=1..infinity; ranges of next terms are [ 68,69 ], [ 128,133 ],[ 247,255 ],[ 378,383 ].

+0
1

2, 4, 7, 13, 21, 37 (list; graph; listen)

	OFFSET	`0,1`
	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).`
	CROSSREFS	`Sequence in context: A026625 A026691 A018150 this_sequence A061257 A061255 A088111` `Adjacent sequences: A019468 A019469 A019470 this_sequence A019472 A019473 A019474`
	KEYWORD	`nonn`
	AUTHOR	`Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca)`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research