Register

self doubts

728 views
0 0 votes
what  is minimum number of states of NFA which accepts language

{abab^n|n>=0} U{aba^n|n>=0}

1 Answer

0 0 votes
exactly 5 states are required

L={ ab,aba,abaa, abaa,.....,abab,abaa..bbbb}

for accepting ab 3 states

ab after that 1 state for any no of a's

then (aaa..abbb..b) any no of a's should be followed by any no of b's 1 state

total no of states=5
Voting & Accepting an answer helps improve the community
← Previous · #sortingNext → · made easy test serie...
← Previous in category · undecidabilityNext in category → · Doubt
Position:
Show:

Related questions

0 0 votes
0 0 answers
652
652 views
prashant dubey asked Apr 27, 2019
652 views
Self doubts DFA
The minimum no. of states required to construct DFA which can accept length of the string is devisable by 4 where input string is 0,1Please also construct dfa
0 0 votes
2 2 answers
740
740 views
altamash asked Dec 25, 2018
740 views
self doubts
{w1 x w2|w1,x,w2∈(a+b)*,w1=w2}it is regular ?????
0 0 votes
0 0 answers
540
540 views
altamash asked Dec 25, 2018
540 views
self doubts
explain why it is CFL?
–1 –1 vote
0 0 answers
578
578 views
altamash asked Sep 21, 2018
578 views
self doubts
what is minimum number of state in the NFA accepting the language;{ab 4ubc}?