2 votes 2 votes Number of states in the $\text{DFA}$ accepting the language $L=\{a^{n}b^{n}|1\leq n\leq 3\}$ over $\sum=\{a,b\}.$ Theory of Computation theory-of-computation finite-automata number-of-states virtual-gate-test-series + – Jason GATE asked Jan 8, 2017 • retagged Apr 14, 2019 by Lakshman Bhaiya Jason GATE 571 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply prateekdwv commented Jan 8, 2017 reply Follow Share Is the answer of this question - 8 states? 0 votes 0 votes Jason GATE commented Jan 8, 2017 reply Follow Share Yes Sir You are Right. Kindly Explain!!! 0 votes 0 votes Jason GATE commented Jan 9, 2017 reply Follow Share Thank you Everyone ! I got the Concept. 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes There is not much to explain this automaton. However, the only take away with this question is that to not add any new state until and unless it is really necessary. HTH prateekdwv answered Jan 8, 2017 • selected Jan 8, 2017 by sourav. prateekdwv comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes L = { ab,aabb,aaabbb } Original DFA : 11 states Minimized DFA : 8 States Gate Mission 1 answered Jan 8, 2017 Gate Mission 1 comment Share Follow See all 2 Comments See all 2 2 Comments reply Pratyush Madhukar commented Jan 8, 2017 reply Follow Share How you drew the diagrams? Looks neat. 1 votes 1 votes Gate Mission 1 commented Jan 8, 2017 reply Follow Share http://madebyevan.com/fsm/ 1 votes 1 votes Please log in or register to add a comment.
