Register

Find the language

307 views
0 votes
0 votes

  1. Regural
  2. CFL
  3. CSL
  4. Recursive
User Avatar

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.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
1 answer
1
srestha asked Jun 3, 2018
2,191 views
Find the language
1)$L_{1}=\left \{ a^{2^{n}} \right \}$ where n is a positive integer. Is it Reguler, CFL or CSL? 2)$L_{2}=\left \{ (a^{n})^{m}.b^{n}|n,m\geq 1 \right \}$ Is it Regular CFL or CSL?
1)$L_{1}=\left \{ a^{2^{n}} \right \}$ where n is a positive integer.Is it Reguler, CFL or CSL?2)$L_{2}=\left \{ (a^{n})^{m}.b^{n}|n,m\geq 1 \right \}$ Is it Regular CFL ...
User Avatar
0 votes
0 votes
0 answers
2
SreenivasaRaju asked May 5, 2018
405 views
How to find out the quotient of regular language with example?
How to find out the quotient of regular language with example?
How to find out the quotient of regular language with example?
User Avatar
1 votes
1 votes
1 answer
3
Garrett McClure asked Oct 14, 2017
992 views
Theory of Computation - Find context-free grammars for the following language
Find a context-free grammar for the following language (with n ≥ 0, m ≥ 0): L = {anwwRbn : w ∈ {a, b} ∗ , n ≥ 1}.
Find a context-free grammar for the following language (with n ≥ 0, m ≥ 0):L = {anwwRbn : w ∈ {a, b} ∗ , n ≥ 1}.
User Avatar
1 votes
1 votes
1 answer
4
Garrett McClure asked Sep 14, 2017
1,542 views
Models of Computation - Find an NFA with two states that accepts the following language
Find an NFA with two states that accepts the following language: L = {an : n ≥ 1} ∪ {bmak : m ≥ 0, k ≥ 0}.
Find an NFA with two states that accepts the following language:L = {an : n ≥ 1} ∪ {bmak : m ≥ 0, k ≥ 0}.
User Avatar
Link Copied!