You are not logged in.
- Topics: Active | Unanswered
Pages:: 1
#1 2015-06-27 04:04:50
Over String:
Mathematics Quizzes Theory Of Computation
Question:
Consider a string s over (0+1)*. The number of 0s in s is denoted by no(s) and the number of 1s in s is denoted by n1(s). The language that is not regular is:
Option A):
L = {s ∈ (0+1)* I for every prefix s of s, I no(s)-n1(s) I ≤ 2}
Option B):
L = {s ∈ (0+1)* I no(s) mod 7 = n1(s) mod 5 = 0}
Option C):
L = {s ∈ (0+1)* I no(s) is a 3 digit prime}
Option D):
L = {s ∈ (0+1)* I no(s)-n1(s) I ≤ 4
Correct Answer is Option D):
L = {s ∈ (0+1)* I no(s)-n1(s) I ≤ 4
Failure is the first step towards seccess.
Offline
2015-06-27 04:04:50
- Advertisement
- Ads By Google
Re: Over String:
\n
Pages:: 1