1 votes 1 votes Turing machine can be constructed by FA with 2 stacks?? A_i_$_h asked Oct 8, 2017 A_i_$_h 557 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Arjun commented Oct 8, 2017 reply Follow Share @srestha what exactly is the "more" for TM? 0 votes 0 votes srestha commented Oct 8, 2017 reply Follow Share More means a computer is not work like stack only. It can accept like queue , linklist etc So, here a language acceptance not like LIFO only, It is also accept by some property like Rice theorem , right? 0 votes 0 votes Shubhanshu commented Oct 8, 2017 reply Follow Share for queue we can use 2 stack implementation. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes FA+2 stack =FA+3stack=FA+4stack=FA+queue=FA+2queue=FA+3queue=FA+2CA=FA+3CA=TM Kaluti answered Oct 16, 2017 Kaluti comment Share Follow See all 2 Comments See all 2 2 Comments reply A_i_$_h commented Oct 16, 2017 reply Follow Share @kaluti what is this? can u explain its meaning 0 votes 0 votes Kaluti commented Oct 16, 2017 reply Follow Share turing machine can be constructed by FA with two stacks or more than two stacks. 0 votes 0 votes Please log in or register to add a comment.