2 votes 2 votes C = {ak | k is multiple of n }. Then how to show that for each n>=1, the language C is regular. Theory of Computation turing-machine regular-language of theory-of-computation + – amrendra pal asked Aug 22, 2017 • edited Aug 22, 2017 by amrendra pal amrendra pal 229 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes we put n equal to 1 . now we can take any value of k and it is always multiple of 1. so regular expression become a*. which is regular. abhishekmehta4u answered Apr 20, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.