...
Question 6790 – Theory-of-Computation
December 2, 2023
Question 3988 – 2006 December UGC NET Paper 1
December 2, 2023
Question 6790 – Theory-of-Computation
December 2, 2023
Question 3988 – 2006 December UGC NET Paper 1
December 2, 2023

Question 6931 – Theory-of-Computation

There are exactly __________ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.

Correct Answer: D

Question 517 Explanation: 

A
64
B
56
C
1024
D
5832

Leave a Reply

Your email address will not be published. Required fields are marked *