Assuming independent hash functions, giving each hash function it’s own bit table is equivalent to having one bit table with a number of bits equal to that of the sum of the numbers of bits in each hash function.

It would be more effective in avoiding false positives, but require more (typically a lot more) space.