10 GATE 2017 CSE: Minimal States of DFA for Language L
Find the minimum number of states in a DFA accepting L = {w1aw2 | |w1|=2, |w2|β₯3} from GATE 2017 CSE solution. π€
GridoWit
3.0K views β’ Jun 3, 2017
About this video
The minimum possible number of states of a deterministic automaton that accepts the regular language L ={w1aw2 | w1 ,w2 Ο΅ {a,b}* , |w1| = 2, |w2| β₯ 3} is ____________.
Video Information
Views
3.0K
Likes
19
Duration
2:39
Published
Jun 3, 2017
User Reviews
4.1
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends