A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. If s is a string over (0 + 1)* then let n0(s) denote the number of 0’s in s and n1(s) the number of 1’s in s. Which one of the following languages is not regular?
Regular languages and finite automata
a. A
b. B
c. C
d. D
Answer:D
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: