A365306 Maximal reset threshold over all binary partial finite automata of n states.

0, 1, 4, 9, 16, 26, 39, 55, 73, 94

Offset

1,3

Comments

The reset threshold of a partial finite automaton A is the length of the shortest word (if it exists) that sends every state of A to a single state (or is undefined).

Links

Table of n, a(n) for n=1..10.

S. Cambie, M. de Bondt, and H. Don, Extremal Binary PFAs with Small Number of States, Int. J. Found. Comput. Sci. 34 (2023), 85-115.

Crossrefs

Sequence in context: A073171 A328363 A049739 * A370307 A006508 A299898

Adjacent sequences: A365303 A365304 A365305 * A365307 A365308 A365309

Keyword

nonn,more

Author

Jeffrey Shallit, Aug 31 2023

Status

approved