Menu

Question Discussion & Solution

MCQ
Q.
The CYK algorithm constructs table from where we can conclude whether w is in L

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.
In pumping lemma for context free language
forum Discussion
MCQ
3.
If we select a string w such that w?L, and w=xyz. Which of the following portions cannot be an empty string?
forum Discussion
MCQ
4.
Which of the following statement is false?
forum Discussion
MCQ
5.
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

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward