Menu

Question Discussion & Solution

MCQ
Q.
Relate the following statement:
Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
The CYK algorithm is also known as
forum Discussion
MCQ
2.
Relate the following statement:
Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.
forum Discussion
MCQ
3.
Which of the following is not an application of Pumping Lemma?
forum Discussion
MCQ
4.
In pumping lemma for context free language
forum Discussion
MCQ
5.
While applying Pumping lemma over a language, we consider a string w that belong to L and fragment it into _________ parts.
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
article

Finite Automata

format_list_bulleted 44 MCQs
article

Context Free Grammars

format_list_bulleted 76 MCQs
article

Push Down Automata

format_list_bulleted 37 MCQs
article

Regular and context free languages

format_list_bulleted 65 MCQs
article

Pumping Lemma

format_list_bulleted 14 MCQs
article

Turning Machine

format_list_bulleted 14 MCQs