MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Automata Theory
→
Non Deterministic Turing Machines
→
State true or false:S-> 0S1|01
1.
State true or false:S-> 0S1|01
A.
nStatement: No regular expression exists for the given grammar.
B.
true
C.
false
Answer» B. true
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The language L ={ai2bi|i>=0} is:
Which of the following are context free language?
Which of the following are non essential while simplifying a grammar?
Statement 1: Ambiguity is the property of grammar but not the language. Statement 2: Same language can have more than one grammar.
Which among the following is incorrect with reference to a derivation tree?
State true or false:S-> 0S1|01
CFGs are more powerful than:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies