We investigate languages consisting of words following one of the give
n finitely many patterns. The issues concerning such multi-pattern lan
guages are relevant in inductive inference, theory of learning and ter
m rewriting. We obtain results about decidability, characterization, h
ierarchies and special classes of multi-pattern languages. Some open p
roblems are also presented.