Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language that is not regular is

Related MCQs

• Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
• If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?
• Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.
• Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :
• Consider the regular language L = (111+111111)*. The minimum number of states inany DFA accepting this language is
• Consider a graph G = (V, E) where I V I is divisible by 3. The problem of finding a Hamiltonian cycle in a graph is denoted by SHAM3 and the problem of determining if a Hamiltonian cycle exits in such graph is denoted by DHAM3. The option, which holds true, is
• A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
• Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:
• If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?
• Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression