MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
Precedence of regular expression in decreasing ord..
1.
Precedence of regular expression in decreasing order is
A.
* , . , +
B.
. , * , +
C.
. , + , *
D.
+ , a , *
Answer» B. . , * , +
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
WHICH_OF_THE_FOLLOWING_PAIR_OF_REGULAR_EXPRESSION_ARE_NOT_EQUIVALENT??$
ΦL is equivalent t?#
(a+b)* is equivalent to
ϵL is equivalent to$
a? is equivalent to
Regular expression Φ* is equivalent to$
Precedence of regular expression in decreasing order is
Regular expression {0,1} is equivalent to
A regular language over an alphabet a is one that can be obtained from
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply