search
Log In
2 votes
80 views

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

in Theory of Computation
edited by
80 views

1 Answer

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.

Related questions

3 votes
1 answer
1
167 views
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
asked Jan 29, 2018 in Theory of Computation all mix 167 views
0 votes
1 answer
2
0 votes
1 answer
3
118 views
Let L be CFL and M a regular language. Language L ⋂ M is always (a) always regular (b) never regular (c) always DCFL (d) always context free language
asked Aug 20, 2017 in Theory of Computation codingo1234 118 views
1 vote
2 answers
4
135 views
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.
asked May 24, 2018 in Theory of Computation Sona Barman 135 views
...