This might be an irritating, naive question, but please bear with me. If an algorithm/code solves the string matching problem for a binary string, does not it imply that the algo/code actually solves the string matching problem in general?
Because, in hardware everything is converted to
1 and then calculation is done.
The idea is binary string matching could be easier than the general case, so if we have a faster algorithm we (may) use that in machine code, and obtain faster general solution.