0 votes 0 votes closed as a duplicate of: GATE CSE 2003 | Question: 50 Theory of Computation finite-automata theory-of-computation minimal-state-automata regular-expression + – Sambhrant Maurya asked Oct 18, 2018 closed Oct 18, 2018 by Shaik Masthan Sambhrant Maurya 479 views comment Share Follow See all 3 Comments See all 3 3 Comments reply akash.dinkar12 commented Oct 18, 2018 reply Follow Share https://gateoverflow.in/939/gate2003-50 1 votes 1 votes Smishra95 commented Oct 18, 2018 i edited by Smishra95 Oct 18, 2018 reply Follow Share total string will 8 0 votes 0 votes akash.dinkar12 commented Oct 18, 2018 reply Follow Share U can follow above link, answer is 7 1 votes 1 votes Please log in or register to add a comment.