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?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Which one of the following languages over the alphabet {0, 1} is described by the regular expression: (0 + ...
- Which one of the following languages over the alphabet {0, 1} is described by the regular expression: (0 + ...
- For S $\in$ (0 + 1) * let d (s) denote the decimal value of s (e.g. d (101) = 5). Let L = {s $\in$ (0 + 1)*...
- For S $\in$ (0 + 1) * let d (s) denote the decimal value of s (e.g. d (101) = 5). Let L = {s $\in$ (0 + 1)*...
- Which of the following is not regular?
- Consider the two statements: S1 : {02n |n $\ge$ 1| } is a regular language S2 : {0m1n 0m+n | m $\ge$ 1 and ...
- The language {ambm+n | m,n $\le$ 1} is
- The language {0i 21i | i $\ge$0} over the alphabet {0, 1, 2} is: