Register

UGC NET CSE | November 2017 | Part 3 | Question: 21

• edited by
2,091 views

2 Answers

3 votes
3 votes
None. Pumping lemma can be used to show that some language is Not regular.

If the given language $L$ does not satisfy pumping lemma for regular languages then It is can never be Regular language. But if a language satisfies pumping lemma for regular languages then it may or may not be Regular language because some Non-regular languages also satisfy pumping lemma for regular languages.

But pumping lemma has No connection with Showing a Grammar is Regular or Not.

Hence, None is correct.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
1 answer
1
Arjun asked Nov 5, 2017
1,564 views
UGC NET CSE | November 2017 | Part 3 | Question: 19
The logic of pumping lemma is an example of _________ Iteration Recursion The divide and conquer principle The pigeon – hole principle
The logic of pumping lemma is an example of _________IterationRecursionThe divide and conquer principleThe pigeon – hole principle
User Avatar
1 votes
1 votes
1 answer
2
Arjun asked Nov 5, 2017
1,139 views
UGC NET CSE | November 2017 | Part 3 | Question: 24
The language $L =\{a^i \: b \: c^i \mid i \geq 0\}$ over the alphabet $\{a, b, c\}$ is regular language Not a deterministic context free language but a context free language Recursive and is a deterministic context free language Not recursive
The language $L =\{a^i \: b \: c^i \mid i \geq 0\}$ over the alphabet $\{a, b, c\}$ isregular languageNot a deterministic context free language but a context free languag...
User Avatar
2 votes
2 votes
2 answers
3
Arjun asked Nov 5, 2017
1,855 views
UGC NET CSE | November 2017 | Part 3 | Question: 23
Finite state machine can recognize language generated by _________ Only context free grammar Only context sensitive grammar Only regular grammar Any unambiguous grammar
Finite state machine can recognize language generated by _________Only context free grammarOnly context sensitive grammarOnly regular grammarAny unambiguous grammar
User Avatar
2 votes
2 votes
1 answer
4
Arjun asked Nov 5, 2017
1,191 views
UGC NET CSE | November 2017 | Part 3 | Question: 22
Which of the following problems is undecidable? To determine if two finite automata are equivalent Membership problem for context free grammar Finiteness problem for finite automata Ambiguity problem for context free grammar
Which of the following problems is undecidable?To determine if two finite automata are equivalentMembership problem for context free grammarFiniteness problem for finite ...
User Avatar
Link Copied!