MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Automata Theory
→
Non Deterministic Turing Machines
→
The number of states required to automate the last...
1.
The number of states required to automate the last question i.e. {a,b}*{aba}{a,b}* using finite automata:
A.
4
B.
3
C.
5
D.
6
Answer» B. 3
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What does the following transition graph shows:
The following turing machine acts like:
If T1 and T2 are two turing machines. The composite can be represented using the expression:
d(q,X)=(r,Y,D) where D cannot be:
The machine accept the string by entering into hA or it can:a) explicitly reject x by entering into hRb) enter into an infinte loopc) Both (
Which of the following regular expression resembles the given diagram?
If T1 and T2 are two turing machines. The composite can be represented using the expression?
Which of the functions can a turing machine not perform?
Which of the following can accept even palindrome over {a,b}
The machine accept the string by entering into hA or it can:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies