MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
How_many_DFA’s_exits_with_two_stat...
1.
How_many_DFA’s_exits_with_two_states_over_input_alphabet_{0,1}_?$
A.
16
B.
26
C.
32
D.
64
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
FINITE_AUTOMATA_REQUIRES_MINIMUM_________NUMBER_OF_STACKS.?$
Regular expression for all strings starts with ab and ends with bba is.$
Number_of_final_state_require_to_accept_Φ_in_minimal_finite_automata.$#
FSM with output capability can be used to add two given integer in binary representation. This is
Number of states require to simulate a computer with memory capable of storing ‘3’ words each of length ‘8’.$
The basic limitation of finite automata is that
How_many_DFA’s_exits_with_two_states_over_input_alphabet_{0,1}_?$
Language of finite automata is?
Languages of a automata is
String X is accepted by finite automata if .
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