This document discusses Turing machines, including what they are, their applications, the components of their instantaneous descriptions, their advantages over finite automata, their objectives, how their configurations are defined, how they accept languages, and provides examples of constructing Turing machines for specific formal languages.
This document discusses Turing machines, including what they are, their applications, the components of their instantaneous descriptions, their advantages over finite automata, their objectives, how their configurations are defined, how they accept languages, and provides examples of constructing Turing machines for specific formal languages.
This document discusses Turing machines, including what they are, their applications, the components of their instantaneous descriptions, their advantages over finite automata, their objectives, how their configurations are defined, how they accept languages, and provides examples of constructing Turing machines for specific formal languages.
This document discusses Turing machines, including what they are, their applications, the components of their instantaneous descriptions, their advantages over finite automata, their objectives, how their configurations are defined, how they accept languages, and provides examples of constructing Turing machines for specific formal languages.
Download as DOC, PDF, TXT or read online from Scribd
Download as doc, pdf, or txt
You are on page 1of 1
1. What is Turing machine?
2. What are the applications of Turing machine?
3. What ate the required field of an instantaneous description of a Turing machine? 4. List the advantages of Turing machine over the finite automata 5. List the primary objectives of the Turing machine? 6. Define the configuration of the Turing machine. 7. Define the language accepted by Turing machine. 8. Construct Turing machine for the language L={anbn cn/n>=1} 9. Construct the Turing machine for the language L={WWR/W is in (0+1)*