0 votes 0 votes Correct ans is Type - 0. My doubt is LBA is also TM and LBA belongs to type - 1 then why ans is not type - 1 Theory of Computation theory-of-computation turing-machine grammar + – Pavan Shetty asked Nov 17, 2018 • edited Mar 14, 2019 by adeebafatima1 Pavan Shetty 287 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Hemanth_13 commented Nov 17, 2018 reply Follow Share RL REL-TYPE 0 CSL-Type 1 CFL TYPE 2 RegL- type 3 0 votes 0 votes Mk Utkarsh commented Nov 17, 2018 reply Follow Share because Type-0 is superset of Type-1 and Type-0 is recognized by TM's 2 votes 2 votes `JEET commented Nov 17, 2018 reply Follow Share Yes the reason is type 0 is superset of type 1. 0 votes 0 votes adeemajain commented Jan 25, 2019 reply Follow Share As here it is not mentioned that whether they are talking about halting turing machine or what.. We will consider the worst case and will answer type 0 as type 0 will contain all other Language in it. Infact TM can accept all type 1 type 2 type 3 but to cover all we answer superset hence type 0 is the answer 1 votes 1 votes Please log in or register to add a comment.
