retagged by
794 views
0 0 votes
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?

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
1.6k
1.6k views
Peace asked Feb 7, 2017
1,634 views
can someone tell me the topics from ullman(not chapters).....i.e. topics from each chapter... thanks in advance !!
0 0 votes
2 2 answers
883
883 views
dhairyya asked Apr 26, 2017
883 views
When will gate 2018 schedule come out? Last year this time it was out for gate 2017
0 0 votes
0 0 answers
491
491 views
goluabhinan asked Sep 16, 2018
491 views
What is the difference between phase structured grammar and phrase structured grammar?
0 0 votes
0 0 answers
573
573 views
goluabhinan asked Sep 10, 2018
573 views
Below is the grammar then find the language generated by given grammarS → ABCAB → aAx |bAy | εxb → bxya → ayC → εyb → byxC → BaCaB → BayC → BbCbB → Bbxa → axCorrect optio...