MHB Is the language ${L}_{n}$ regular?

  • Thread starter Thread starter JamesBwoii
  • Start date Start date
  • Tags Tags
    Language Regular
JamesBwoii
Messages
71
Reaction score
0
Hi, I'm back with another question, but the opposite of last time.

The question is:

For each positive integer $n$, let ${L}_{n}$ = { ${a}^{k}$ $|$ $k$ is a multiple of $n$ }
Show that for each $n$ the language ${L}_{n}$ is regular. As far as I understand you cannot use pumping lemma to prove a language is regular.

I assume that leaves me with having to do a NFA, DFA or regular expression as I don't know where to begin to create one of those for this language.

Thanks!
 
Physics news on Phys.org
The easiest way to define regular languages is using regular expressions. Can you write a regular expression describing $L_1=\{a^k\mid k\ge0\}=\{a\}^*$?
 
Evgeny.Makarov said:
The easiest way to define regular languages is using regular expressions. Can you write a regular expression describing $L_1=\{a^k\mid k\ge0\}=\{a\}^*$?

Honestly no, I just can't see it. I'm really struggling with this particular problem sheet.
 
Then you should read the definition and examples of regular expressions, for example, in Wikipedia.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top