The Gateway to Computer Science Excellence
+2 votes
572 views

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

  1. 64
  2. 256
  3. 1024
  4. 5832
closed as a duplicate of: UGCNET-Dec2015-III: 27
in Others by Veteran
closed by | 572 views
0
0
2^(2^3) =256 ?? not sure though

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,217 questions
59,951 answers
201,131 comments
118,172 users