id:A000802 - OEIS Search Results

Search: id:A000802

Displaying 1-1 of 1 results found.

page 1

Maximal number of states in deterministic finite automaton accepting a language consisting of some words of length n.

+0
1

1, 2, 4, 7, 11, 19, 34, 50, 82, 146, 274, 529, 785, 1297, 2321, 4369, 8465, 16657, 33041, 65809, 131344, 196880, 327952, 590096, 1114384, 2162960, 4260112, 8454416, 16843024, 33620240, 67174672, 134283536, 268501264, 536936720 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`Champarnaud, J.-M.; Pin, J.-E.; A maxmin problem on finite automata. Discrete Appl. Math. 23 (1989), no. 1, 91-96.`
	CROSSREFS	`Adjacent sequences: A000799 A000800 A000801 this_sequence A000803 A000804 A000805` `Sequence in context: A003292 A007864 A118647 this_sequence A080005 A024501 A018173`
	KEYWORD	`nonn`
	AUTHOR	`Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca)`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research