Register

Dfa doubt

369 views
0 votes
0 votes
What is the number of states in the minimal dfa representing the language a*b* ?
User Avatar

1 Answer

2 votes
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
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
manisha11 asked May 12, 2019
404 views
self doubt dfa
Given an algorithm to tell whether a regular language L contains at least 100 strings
Given an algorithm to tell whether a regular languageL contains at least 100 strings
User Avatar
0 votes
0 votes
1 answer
3
altamash asked Dec 30, 2018
880 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)1 b)2 c)3 d)4 e)there not fixed
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...
User Avatar
0 votes
0 votes
1 answer
4
Lakshman Bhaiya asked Dec 27, 2018
576 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’$
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�...
User Avatar
Link Copied!