The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Number of FA's possible for two states X,Y over the input alphabet {a,b} where X is always the initial state and the FA should accept only empty  language ?
asked in Theory of Computation by (99 points) | 25 views

please Before adding the question, just check is it asked or not?

duplicate of

1 Answer

0 votes

here we will have 2 cases :

CASE 1 : when we donot have any final state means each symbol can goto any state means each symbol has 2 choices for any state.

CASE 2 : when we have 1 final state but its not reachable. so final state will have 2 choices of states to move on to for each symbol and initial will have only one choice.. so answer is 20 as initial state is fixed.

answered by Boss (11.8k points)

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
47,913 questions
52,293 answers
67,738 users