0 votes 0 votes Regularity check Theory of Computation theory-of-computation + – balchandar reddy san asked Jan 19, 2019 balchandar reddy san 316 views answer comment Share Follow See 1 comment See all 1 1 comment reply Somoshree Datta 5 commented Jan 19, 2019 reply Follow Share answer is D? 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes D is answer Option A) Finite Option B) Finite bcoz limited values of m and n have L.C.M=2 Option C) Finite bcoz you can draw DFA till 100 and 1 extra state for >=100. Refer:-https://gateoverflow.in/235681/identification-of-regular?show=235694 Ravi kumar singh answered Jan 19, 2019 • selected Jan 19, 2019 by balchandar reddy san Ravi kumar singh comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes upper bound is specified due to this regular SUNNY054 answered Jan 21, 2019 SUNNY054 comment Share Follow See all 0 reply Please log in or register to add a comment.
