3 ms·
The functions emulate deterministic finite automata that read binary strings and determine divisibility. See: http://stackoverflow.com/questions/15330027/regu
by gamegoblin 13y ago
The functions emulate deterministic finite automata that read binary strings and determine divisibility.
See:
http://stackoverflow.com/questions/15330027/regular-expression-for-binary-numbers-divisible-by-3 http://stackoverflow.com/questions/15330027/regular-expressi...
http://ugccomputerscience.blogspot.com/2012/02/dfa-of-binary-number-divisible-by-5.html http://ugccomputerscience.blogspot.com/2012/02/dfa-of-binary...