General syllabus doubt

Question

Hello,

The gate 2018 syllabus explicitly mentions regular languages, context free languages and turing machines. It does not say anything about context sensitive languages and linear bounded automata..How much of these topics should i study?..definitions? closure properties?

Comments

CSL, and LBA is a subset of Turning machines.It is turning machine with limited space like our computers.I think just concepts will do,you might try to find out languages which can be done in LBA but not PDA or only infinite space TM not LBA.Mostly MCQs come for automata,I hope they wont ask for internal states in LBA or transitions.