We characterize regular languages as the equality sets of sequences generated by compatible uniform HDT0L systems.