MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
(a + b*c) most correctly represents:..
1.
(a + b*c) most correctly represents:
A.
(a +b) *c
B.
(a)+((b)*.c)
C.
(a + (b*)).c
D.
a+ ((b*).c)
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Dot operator in regular expression resembles which of the following?
According to the precedence rules, x-y-z is equivalent to which of the following?
Which of the following regular expressions represents the set of strings which do not contain a substring rt if = {r, t}
(a + b*c) most correctly represents:
The finite automata accept the following languages:
Which of the following represents a language which has no pair of consecutive 1 s if = {0,1}?
If = {0,1}, then * will result to:
Let for = {0,1} R= ( ) *, the language of R would be
Which of the following is correct?<br>Statement 1: represents a single string in the set.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply