Efficient algorithm for merging consistent rows of multiple 2d arrays

Question

I have an arbitrary number of 2d arrays of equal width but possibly non-equal height. They can consist of 1s, 0s, or a wildcard * which can match either a 1 or a 0.