2 votes 2 votes What is Equality Problem in Theory of computation? Theory of Computation theory-of-computation decidability context-free-language identify-class-language + – Nikhil Patil asked Nov 21, 2017 Nikhil Patil 272 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Equality Test for TM Theorem: EQTM is undecidable Let EQTM be the language { <M1 , M2>| M1 , M2 are TMs, L(M1 ) = L(M1 ) } Red_devil answered Nov 21, 2017 Red_devil comment Share Follow See all 2 Comments See all 2 2 Comments reply Nikhil Patil commented Nov 21, 2017 reply Follow Share Sir, it will be better if you explain by words then after example 0 votes 0 votes Red_devil commented Nov 21, 2017 reply Follow Share read from here http://www.cs.nthu.edu.tw/~wkhon/toc07-lectures/lecture14.pdf 0 votes 0 votes Please log in or register to add a comment.