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
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
KEYWORD
nonn,more
AUTHOR
Jeffrey Shallit, Aug 31 2023
STATUS
approved