Scribd
Upload
13 views1 page

2022-23 - Even - ET - CSE - TOC

The document outlines an end-term examination for the Theory of Computation course at the LNM Institute of Information Technology, scheduled for May 11, 2023. It consists of various questions requiring students to construct automata, analyze languages, and demonstrate understanding of Turing machines and grammars. Each answer must include proper justification to receive marks, emphasizing the importance of detailed explanations in the responses.

Uploaded by

wwwkartiksingh121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
13 views1 page

2022-23 - Even - ET - CSE - TOC

The document outlines an end-term examination for the Theory of Computation course at the LNM Institute of Information Technology, scheduled for May 11, 2023. It consists of various questions requiring students to construct automata, analyze languages, and demonstrate understanding of Turing machines and grammars. Each answer must include proper justification to receive marks, emphasizing the importance of detailed explanations in the responses.

Uploaded by

wwwkartiksingh121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 1
The LNM Institute of information Technology End Term Examination Theory of Computation Full Marks:- 50 Time:- 3hrs Date:- 11/05/2023 ‘Answer all questions Instruction:- Write proper justification with each answer. Answer without justification willbe given zero marks. 1) 2) 3) 4) 5) 6) 7 8) Construct a LBA for language L={a"b"c"|n 21} 5 Let 3 = (a,b) and L = (a"b"":m > n +3). Find Lis deterministic context free language or not. If yes, then give the supporting automata. 5 Use the CYK method to determine if the string w=aabbb is in the language generated by the grammar SAB A>BBla BOABLb; 9 Transform the grammar with production 4 SPABlaB AP abb/A B>bbA in CNF Construct a Turing machine of L = (WW: WE{a, b}*). 8 Let § be an infinite countable set, then prove that the power set 2° of $ is uncountable. 5 2) Define the transition function of a multitape Turing machine with stay option. b) Construct ¢ two tape Turing machine with stay options, to accept language {ww : wE a, b}'} and the input is intially all on tape. 2d Give regular expression and draw DFA for the following language 1 = (W- WELa, DY? | (mg (w) — m,(w))%3 + 0} 7

You might also like