in Theory of Computation
284 views
0 votes
0 votes

  1. Regural
  2. CFL
  3. CSL
  4. Recursive
in Theory of Computation
284 views

3 Comments

C?
0
0
i think this is a regular language.

as we are only concerned with modular counting
0
0

 confirm whats ans

0
0

2 Answers

0 votes
0 votes
This is going to be a regular language. This is because infinite modular counting is allowed in regular languages. We can give an automaton in which string length is divisible by 5. Don't ask me to draw the DFA, as it is going to be a tedious task.
0 votes
0 votes
it is regular, mod function is always regular.

Related questions