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

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

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 ?

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

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.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 15

40,903 questions

47,555 answers

146,266 comments

62,304 users