Even-palindrome is a ________ language.
- ANon-regular
- BRegular
- CRegular but infinite
- DRegular but finite
Even-length palindromes need unbounded memory to match the two halves, so no FA accepts them.
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
Even-palindrome is a ________ language.
Even-length palindromes need unbounded memory to match the two halves, so no FA accepts them.
Which of the following is NOT a regular language?
All three languages fail the pumping lemma, so none is regular.
Set of all palindromes over {a,b} is regular
PALINDROME fails the pumping lemma, so it is nonregular.
a^n b^n generates the ________ language
a^n b^n is nonregular; it is only a subset of EQUAL, not EQUAL itself.
For a non regular language there exist ________ FA
A language accepted by an FA is regular, so a nonregular language has no FA.
A non regular language can be represented by
RE, FA and TG all describe only regular languages.
Any language that can not be expressed by a RE is said to be regular language.
A language with no RE is nonregular.
The language that can be expressed by any regular expression is called a Non regular language.
A language with an RE is regular.
Set of all palindromes over {a,b} is:
PALINDROME fails the pumping lemma, so it is nonregular.
For a non regular language there exist …… FA:
No FA accepts a nonregular language.
A language of strings of prime length is considered to be:
PRIME is shown nonregular with the pumping lemma: pumping changes the length to a non-prime.
No MCQs match this filter.Is filter mein koi MCQ nahi.
No short questions added yet.Abhi koi short sawal shamil nahi.
No long questions added yet.Abhi koi long sawal shamil nahi.