1 votes 1 votes Please explain how to solve this question.! Theory of Computation theory-of-computation turing-machine + – Anmol_Binani asked Jan 2, 2018 Anmol_Binani 361 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu007 commented Jan 2, 2018 reply Follow Share Finite automata + stack = CFL , DCFL Finite automata + counter > finite automata but less than < Finite automata + stack finite automata + 2 counter = has equal power as TM 0 votes 0 votes Anmol_Binani commented Jan 2, 2018 reply Follow Share Can you please send me a link where i can get more details about the same. 0 votes 0 votes Anu007 commented Jan 2, 2018 reply Follow Share https://cs.stackexchange.com/questions/11155/can-an-fsa-count 0 votes 0 votes Please log in or register to add a comment.
