The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
22 views
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) | 22 views
0

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

duplicate of https://gateoverflow.in/16808/many-state-drawn-over-alphabet-which-accepts-empty-language

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 Loyal (9.7k 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

44,073 questions
49,595 answers
162,959 comments
65,789 users