Register

Dfa doubt

930 views

1 Answer

2 2 votes

 

3 states for a*b*  

a cannot be present after first b is encountered

 

Note however that (a*b*)* = (a+b)* which requires only 1 state 

• edited by
Voting & Accepting an answer helps improve the community
← Previous · sizeofNext → · Self Doubt
← Previous in category · MadeEasy WorkBook: T...Next in category → · Self Doubt - Confusi...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
973
973 views
manisha11 asked May 12, 2019
973 views
self doubt dfa
Given an algorithm to tell whether a regular languageL contains at least 100 strings
1 1 vote
1 1 answer
2.1k
2.1k views
Bhaskar Singh asked Feb 20, 2019
2,142 views
Self Doubt - Confusion on language represented by DFA and NFA
If a DFA "D" have symbol {0,1,2} and NFA "N" have symbol {0,1} but both are representing strings ending with 01 and whole string only contain {0,1} then can we say L(N) =...
0 0 votes
1 answers 1 answer
1.8k
1.8k views
altamash asked Dec 30, 2018
1,832 views
DFA doubt
let M be a DFA {a,b} with exactly 2 state .Suppose further that M accepts a finite number n of distinct words .what is the maximum value of n?a)1b)2c)3d)4e)there not fixe...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
Lakshman Bhaiya asked Dec 27, 2018
1,236 views
Self doubt TOC DFA
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a’$