2 votes 2 votes B = { x | x is a binary number that is a multiple of n }. Then how to proove that for each n>=1, the language B is regular. Theory of Computation regular-language theory-of-computation + – amrendra pal asked Aug 22, 2017 amrendra pal 139 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.