# regular language

80 views

C = {ak | k is multiple of n }. Then how to show that for each n>=1, the language C is regular.

edited

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.

## Related questions

1
167 views
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
Identify the language generated by the following grammar: $S->AB$ $A->aAb|\epsilon$ $B->bB|b$ (A)$\{a^m b^n|n≥m, m>0\}$ (B)$\{a^m b^n|n≥m, m≥0\}$ (C)$\{a^m b^n|n>m, m>0\}$ (D)$\{a^m b^n|n>m, m≥0\}$ I select option C but it is wrong, correct answer is option D. I could not understand Gradup answer explanation.Please help me to rectify my fault.