1 Define multitape Turing Machine.
2 Explain the Basic Turing Machine model and explain in one move.What are the actions take place in TM?
3 Explain how a Turing Machine can be regarded as a computing device to compute integer functions.
4 Describe the non deterministic Turing Machine model. Is it true the non deterministic Turing Machine model’s are more powerful than the basic Turing Machines? (In the sense of language Acceptance).
5 Explain the multi tape Turing Machine mode. Is it more power than the basic turing machine? Justify your answer.
6 Using Pumping lemma Show that the language L={ anbncn|n>=1} is not a CFL.
7 What is meant by a Turing Machine with two way infinite tape.
8 Define instantaneous description of a Turing Machine.
9 What is the class of language for which the TM has both accepting and rejecting configuration? Can this be called a Context free Language?
10.The binary equivalent of a positive integer is stored in a tape. Write the necessary transition to multiply that integer by 2.
1 What is the role of checking off symbols in a Turing Machine?
2 State Pumping lemma for Context free language.
3 Define a Turing Machine.
4 Mention any two problems which can only be solved by TM.
5 State Pumping lemma and its advantages.
6 What are useless symbols in a grammar.
2 Explain the Basic Turing Machine model and explain in one move.What are the actions take place in TM?
3 Explain how a Turing Machine can be regarded as a computing device to compute integer functions.
4 Describe the non deterministic Turing Machine model. Is it true the non deterministic Turing Machine model’s are more powerful than the basic Turing Machines? (In the sense of language Acceptance).
5 Explain the multi tape Turing Machine mode. Is it more power than the basic turing machine? Justify your answer.
6 Using Pumping lemma Show that the language L={ anbncn|n>=1} is not a CFL.
7 What is meant by a Turing Machine with two way infinite tape.
8 Define instantaneous description of a Turing Machine.
9 What is the class of language for which the TM has both accepting and rejecting configuration? Can this be called a Context free Language?
10.The binary equivalent of a positive integer is stored in a tape. Write the necessary transition to multiply that integer by 2.
1 What is the role of checking off symbols in a Turing Machine?
2 State Pumping lemma for Context free language.
3 Define a Turing Machine.
4 Mention any two problems which can only be solved by TM.
5 State Pumping lemma and its advantages.
6 What are useless symbols in a grammar.
No comments:
Post a Comment