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
→
Finite automata requires minimum _______ number of...
1.
Finite automata requires minimum _______ number of stacks.
A.
1
B.
0
C.
2
D.
None of the mentioned
Answer» C. 2
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Number of states require to simulate a computer with memory capable of storing 3 words each of length 8 .
How many DFA s exits with two states over input alphabet {0,1} ?
Regular expression for all strings starts with ab and ends with bba is.
Number of final state require to accept in minimal finite automata.
Finite automata requires minimum _______ number of stacks.
Language of finite automata is.
*(q,ya) is equivalent to .
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
