MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
How many DFA s exits with two states over input al..
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
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