AD-501 · Theory of Computation/Unsolved PYQ Paper
AD-501 Theory of Computation - Jun 2025 Question Paper
-
Unit 17 MarksaDefine finite automata and list the features of finite automata with an example.
-
Unit 17 MarksbDesign a finite automata with $$\Sigma = \{0,1\}$$ accepts those strings which starts with 1 and ends with 0.
-
Unit 17 MarksaDifferentiate between Mealy and Moore machines with a suitable example.
-
Unit 27 MarksbDesign a regular expression for the following DFA.
-
Unit 24 MarksiCompute the $\epsilon$-closure of each state.
-
Unit 24 MarksiiGive all the strings of length 4 or less accepted by the automation.
-
Unit 26 MarksiiiConvert the automation to DFA.
-
Unit 47 MarksaShow that the language $$L = \left\{0^n 1^n \mid n \ge 1\right\}$$ is deterministic context free language.
-
Unit 37 MarksbDefine parse tree and construct a parse tree for the string 'abaabb' from the following given grammar. S -> SS/aSb/\u03b5
-
Unit 37 MarksaConvert the given CFG into GNF: S -> ABA/AB/BA/AA/B A -> aA/a B -> bB/b
-
Unit 47 MarksbDefine pushdown automata and explain its model with a neat sketch.
-
Unit 47 MarksaConstruct a PDA for the given language $$L = \left\{ W W^{R} \mid W \in \{a,b\}^{*} \right\}.
-
Unit 47 MarksbConvert the following grammar into PDA which accepts the same language by empty stack. S -> 0S1/A A -> 1A0/S/\u03b5
-
Unit 57 MarksaDesign a turing machine over \{0,1\} for the language $$L = \left\{ W \mid W \text{ is a multiple of } 3 \right\}.
-
Unit 57 MarksbFind whether, the post correspondence problem P = \{(ba, bab), (abb, bb), (bab, abb)\} has a match? Explain in detail.
-
Unit 2OR Choice7 MarksaArden's theorem
-
Unit 3OR Choice7 MarksbChomsky hierarchy of the grammar
-
Unit 4OR Choice7 MarkscNPDA
-
Unit 5OR Choice7 MarksdN-P Complete problem
Go to where you left off?
Quick Add to Notes
Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.
Create free accountHave an account? Log in
Notes Panel