2 votes 2 votes Which machine is equally powerful in both deterministic and non-deterministic form? Push Down Automata Turing machine Linear Bounded Automata None of the options Theory of Computation nielit2017dec-scientistb pushdown-automata turing-machine + – admin asked Mar 30, 2020 retagged Aug 5, 2020 by Lakshman Bhaiya admin 1.6k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply s_dr_13 commented Mar 14, 2022 reply Follow Share What about LBA ?? 0 votes 0 votes 33 commented Mar 14, 2022 reply Follow Share @s_dr_13 In a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine... B). Turing machine … 1. https://www.csa.iisc.ac.in/~deepakd/atc-2016/Seminar-LBA.pdf 2. https://en.wikipedia.org/wiki/Linear_bounded_automaton#Operation 3. https://www.csa.iisc.ac.in/~deepakd/atc-2011/lba.pdf 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes answer is (B) FOR TURING MACHINE DETERMINISTIC as well as NON-DETERMINISTIC MACHINE have same power abhishek tiwary answered Dec 18, 2017 abhishek tiwary comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option B) Turing Machine is the correct answer. Sanandan answered Oct 3, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.