Languages are proved to be regular or non regular using pumping lemma.

Related MCQs

• The logic of pumping lemma is a good example of
• Pumping lemma is generally used for proving that
• Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
• The languages -------------- are the examples of non regular languages.
• Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?
• 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?
• P, Q, R are three languages. If P & R are regular and if PQ=R, then
• Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
• Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
• 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?