BORIS ALEXEEV: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:2914:29, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,323 bytes +1,323‎ Created page with "Title: BORIS ALEXEEV Research Question: How many states does a minimal DFA that recognizes the set of base-b numbers divisible by k have? Methodology: The author used two implementations of the Hopcroft minimization algorithm: a original Perl program and the highly-optimized AT&T FSM PackageTM. These algorithms were used to compute the function fb(k) for various values of b and k. Results: The author derived a closed-form expression for the function fb(k) and used it..."
Retrieved from "https://simplesci.org/wiki/BORIS_ALEXEEV"