MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
P, O, R be regular expression over , P is not ,...
1.
P, O, R be regular expression over , P is not , thenR=Q + RP has a unique solution:
A.
Q*P
B.
QP*
C.
Q*P*
D.
(P*O*) *
Answer» C. Q*P*
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