MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
(0+ ) (1+ ) represents
1.
(0+ ) (1+ ) represents
A.
{0, 1, 01, }
B.
{0, 1, }
C.
{0, 1, 01 ,11, 00, 10, }
D.
{0, 1}
Answer» B. {0, 1, }
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The minimum number of states required to automate the following Regular Expression:(1) *(01+10) (1) *
(0+ ) (1+ ) represents
In order to represent a regular expression, the first step to create the transition diagram is:
Arden s theorem is true for:
P, O, R be regular expression over , P is not , thenR=Q + RP has a unique solution:
Simplify the following regular expression: +1*(011) *(1*(011) *) *
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
