PadhaiBy Astra Cloud
Menu
Search

TU

BSc CSITSyllabusNotesQuestions
BCASyllabusNotesQuestions
BITSyllabusNotesQuestions
BIMSyllabusNotesQuestions
BBASyllabusNotesQuestions
BBSSyllabusNotesQuestions
BBMSyllabusNotesQuestions
BITMSyllabusNotesQuestions

PU

BE Computer (PU)SyllabusNotesQuestions
BBA (PU)SyllabusNotesQuestions

NEB

Class 10SyllabusNotesQuestions
+2 ScienceSyllabusNotesQuestions
+2 ManagementSyllabusNotesQuestions
+2 HumanitiesSyllabusNotesQuestions
All universities and programs →

More

Ask a doubtNoticesGPA calculatorMy study

CSC262 Theory of Computation

Theory of ComputationTU Board 2080 (new course)

What is intractability? Define time and space complexity of turing machine.

5
A worked answer is on its wayMeanwhile, read the Theory of Computation notes for this topic.

Discussion

Loading…

More Theory of Computation questions

List the applications of Pumping Lemma. Minimize the following DFA using the Table Filling Algorithm [figure in the original paper]TU Board 208210Define yield in parse tree with example. Convert the following grammar to CNF: aligned S & ASB \\ A & 0AS 0\\ B & SIS A alignedTU Board 208210Distinguish between multi tape and multi track Turing Machine. Design a TM that accepts a string over the alphabet =\a,b\ , such that L=\a^n b^n n 0\ .TU Board 208210Why do we need asymptotic notation? Discuss about alphabet and power of alphabet.TU Board 20825Define ambiguous grammar. How do you use parse tree to show the ambiguity of a grammar?TU Board 20825Given the non deterministic Turing machine, TM = (q0, q1, q2, qf, 0, 1, 0, 1, B, δ, q0, B, qf) with the following transition rules, describe the language…TU Board 20825

All Theory of Computation old questions