MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
Q*P..
1.
Q*P
A.
QP*
B.
Q*P*
C.
(P*O*) *
Answer» D.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Regular Expression denote precisely the ________ of Regular Language.
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) *) *
(0+‚ÂÀ√≠¬¨¬µ)_(1+‚ÂÀ√≠¬¨¬µ)_REPRESENTS?$#
The_minimum_number_of_states_required_to_automate_the_following_Regular_Expression:$
The difference between number of states with regular expression (a + b) and (a + b) * is:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
