MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
The closure property of context free grammar inclu..
1.
The closure property of context free grammar includes :
A.
Kleene
B.
Concatenation
C.
Union
D.
All of the mentioned
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
NPDA stands for
The context free grammar which generates a Regular Language is termed as:
A null production can be referred to as:
A context free grammar can be recognized bya) Push down automatab) 2 way linearly bounded automatac) Both (
Which of the following automata takes queue as an auxiliary storage?
If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called
THE_CONTEXT_FREE_GRAMMAR_WHICH_GENERATES_A_REGULAR_LANGUAGE_IS_TERMED_AS:?$
NPDA_stands_for$
A null production can be referred to as?
A context free grammar can be recognized by
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply