but what if it is a DFA accepting suppose (ab)* but max such that the number of a nd b's is 10

then how come it accepts sigma*

then how come it accepts sigma*

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+1 vote

0

but what if it is a DFA accepting suppose (ab)* but max such that the number of a nd b's is 10

then how come it accepts sigma*

then how come it accepts sigma*

+2

In case of (ab)* all states are not final state. In question they have mentioned if all states are final state.

0

okay then assume the dfa is accepting atmost 2 a's

in that case all states are final ststes right

but it isnt accepting sigma*

in that case all states are final ststes right

but it isnt accepting sigma*

0 votes

yes it is true because in dfa we show transition for every symbol on each state .if we have a dfa which accepts all strings (0+1)* for a given input symbols {0,1,2} then for any transition with 2 as the input symbol will lead to a dead state / trap state.when we make all the states as accepting states we include dead state also otherwise it will not be (sigma)^(*).

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.2k
- Digital Logic 2k
- Programming & DS 3.7k
- Algorithms 3.2k
- Theory of Computation 4k
- Compiler Design 1.6k
- Databases 3k
- CO & Architecture 2.6k
- Computer Networks 3k
- Non GATE 1k
- Others 1.3k
- Admissions 488
- Exam Queries 436
- Tier 1 Placement Questions 18
- Job Queries 56
- Projects 9

36,201 questions

43,662 answers

124,111 comments

42,944 users