Are non-regular languages decidable?
Context-free languages are not regular but decidable; on the other hand recursively enumerable languages are not regular and only semi-decidable. So sadly only knowing about the non-regularity of a language does not help with determining its decidability.