Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.

A000802

Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =7a(4) =11a(5) =19a(6) =34a(7) =50a(8) =82a(9) =146a(10) =274a(11) =529a(12) =785a(13) =1297a(14) =2321a(15) =4369a(16) =8465a(17) =16657a(18) =33041a(19) =65809a(20) =131344a(21) =196880a(22) =327952a(23) =590096a(24) =1114384a(25) =2162960a(26) =4260112a(27) =8454416a(28) =16843024a(29) =33620240

External references