login
Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12345678910)*.
8

%I #9 Sep 08 2022 08:46:09

%S 41,40,21,11,11,40,41,20,11,10,41,40,21,11,11,40,41,20,11,10,41,40,21,

%T 11,11,40,41,20,11,10,41,40,21,11,11,40,41,20,11,10,41,40,21,11,11,40,

%U 41,20,11,10,41,40,21,11,11,40,41,20,11,10,41,40,21,11,11,40

%N Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12345678910)*.

%H Klaus Sutner and Sam Tetruashvili, <a href="http://www.cs.cmu.edu/~sutner/papers/auto-seq.pdf ">Inferring automatic sequences</a> (see table on the p. 5).

%F G.f.: x^2*(41 + 40*x + 21*x^2 + 11*x^3 + 11*x^4 + 40*x^5 + 41*x^6 + 20*x^7 + 11*x^8 + 10*x^9) / (1-x^10).

%t CoefficientList[Series [(41 + 40 x + 21 x^2 + 11 x^3 + 11 x^4 + 40 x^5 + 41 x^6 + 20 x^7 + 11 x^8 + 10 x^9)/(1 - x^10), {x, 0, 40}], x]

%o (Magma) &cat[[41,40,21,11,11,40,41,20,11,10]: n in [0..10]];

%Y Cf. A176059, A217515 - A217518, A247387.

%K nonn,easy

%O 2,1

%A _Vincenzo Librandi_, Sep 16 2014