if NFA has $N$ states then DFA can have $M$ states where $1\leq M \leq 2^N$

The Gateway to Computer Science Excellence

+29 votes

Best answer

+9 votes

Answer is 2^N.

Example DFA-> 3rs symbol from right is x.

https://gateoverflow.in/544/gate1991_17-b

Here you have to use 2^3 symbols.

nth symbol from right is x , this DFA will have 2^n state.s

Example DFA-> 3rs symbol from right is x.

https://gateoverflow.in/544/gate1991_17-b

Here you have to use 2^3 symbols.

nth symbol from right is x , this DFA will have 2^n state.s

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,741 questions

57,253 answers

198,069 comments

104,705 users