Menu

Question Discussion & Solution

MCQ
Q.
Define for a context free language L ? {0, 1}* ,  init(L)={u ? uv ? L for some v in {0,1}?} ( in other words, init(L) is the set of prefixes of L) Let L = {w ? w is nonempty and has an equal number of 0

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.
Push down automata accepts which language?
forum Discussion
MCQ
2.
A PDA machine configuration (p, w, y) can be correctly represented as:
forum Discussion
MCQ
3.
|-* is the __________ closure of |-
forum Discussion
MCQ
4.
Pushdown automata can recognize language generated by_________.
forum Discussion
MCQ
5.
State true or false:Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
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