The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
59 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 by Active (2.2k points)
edited by | 59 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.

by Boss (34.6k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,093 questions
55,328 answers
190,852 comments
86,255 users