Paper Tayyari

Lecture 25: Nonregular languages

MCQs, short and long questions from lecture 25.Lecture 25 ki MCQs, short aur long sawal.

11 MCQs · 11 MCQs from past papers11 MCQs · 11 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/11
– correctsahi
1.
★ Final term Fall 2012

Even-palindrome is a ________ language.

  1. ANon-regular
  2. BRegular
  3. CRegular but infinite
  4. DRegular but finite

Even-length palindromes need unbounded memory to match the two halves, so no FA accepts them.

2.
★ Final term Spring 2010

Which of the following is NOT a regular language?

  1. AString of 0's whose length is a perfect square
  2. BSet of all palindromes made up of 0's and 1's
  3. CString of 0's whose length is a prime number
  4. DAll of the given options

All three languages fail the pumping lemma, so none is regular.

3.
★ Final term past paper

Set of all palindromes over {a,b} is regular

  1. ATrue
  2. BFalse

PALINDROME fails the pumping lemma, so it is nonregular.

4.
★ Final term past paper

a^n b^n generates the ________ language

  1. Aregular
  2. Bnon regular
  3. CEQUAL and non regular
  4. DEQUAL and regular

a^n b^n is nonregular; it is only a subset of EQUAL, not EQUAL itself.

5.
★ Final term past paper

For a non regular language there exist ________ FA

  1. AOne
  2. BAt least one
  3. CAt most one
  4. DNo

A language accepted by an FA is regular, so a nonregular language has no FA.

6.
★ Final term past paper

A non regular language can be represented by

  1. ARE
  2. BFA
  3. CTG
  4. DNone of the given options

RE, FA and TG all describe only regular languages.

7.
★ Final term past paper

Any language that can not be expressed by a RE is said to be regular language.

  1. ATrue
  2. BFalse

A language with no RE is nonregular.

8.
★ Final term past paper

The language that can be expressed by any regular expression is called a Non regular language.

  1. ATrue
  2. BFalse

A language with an RE is regular.

9.
★ Final term 2013

Set of all palindromes over {a,b} is:

  1. ARegular
  2. BRegular and finite
  3. CRegular and infinite
  4. DNon-regular

PALINDROME fails the pumping lemma, so it is nonregular.

10.
★ Final term past paper

For a non regular language there exist …… FA:

  1. ANO
  2. BYes

No FA accepts a nonregular language.

11.
★ Final term past paper

A language of strings of prime length is considered to be:

  1. Aregular but infinite
  2. Bregular
  3. Cirregular
  4. Dregular but finite

PRIME is shown nonregular with the pumping lemma: pumping changes the length to a non-prime.