Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 12, Problem 15CRP
Program Plan Intro
Turing machine:
- A Turing Machine denotes a mathematical computation model that defines abstract machine.
- It manipulates symbols on tape strip based on table of rules.
- It can operate on an infinite memory tape that is divided into discrete cells.
- It has a head pointer that points to cell currently being read and it can move in both directions.
- It can be expressed as a 7-tuple that includes (Q, T, B, ∑, δ ,q0, B, F) , the details are shown below:
- The symbol “Q” denotes a finite set of states.
- The symbol “T” denotes tape alphabet.
- The symbol “B” denotes a blank symbol.
- The symbol “∑” denotes an input alphabet.
- The symbol “δ” denotes a transition function.
- The symbol “q0” denotes an initial state in the machine.
- The symbol “F” denotes a set of final states.
- The time complexity denotes measure of count of times tap moves when machine is initialized for some input symbols.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Design a Turing Machine that takes 2 unary numbers on the tape, where the first number is greater than the second number, and computes and writes a unary number to the tape that is the first number minus the second number.
Design a Turing machine that accepts the set of strings with an equal number of 1’s and 0’s (in any mixed order). Include a high-level description of its algorithm and draw its transition diagram.
Design a Turing machine with no more than three states that accepts the language L(a(a+b)*). Assume that Σ = {a,c}.
-> Is it possible to do this with a two-state machine? Why or why not?
Chapter 12 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Ch. 12.1 - Prob. 1QECh. 12.1 - Prob. 2QECh. 12.1 - Prob. 3QECh. 12.1 - Prob. 4QECh. 12.2 - Prob. 1QECh. 12.2 - Prob. 2QECh. 12.2 - Prob. 3QECh. 12.2 - Prob. 4QECh. 12.2 - Prob. 5QECh. 12.3 - Prob. 1QE
Ch. 12.3 - Prob. 3QECh. 12.3 - Prob. 5QECh. 12.3 - Prob. 6QECh. 12.4 - Prob. 1QECh. 12.4 - Prob. 2QECh. 12.4 - Prob. 3QECh. 12.5 - Prob. 1QECh. 12.5 - Prob. 2QECh. 12.5 - Prob. 4QECh. 12.5 - Prob. 5QECh. 12.6 - Prob. 1QECh. 12.6 - Prob. 2QECh. 12.6 - Prob. 3QECh. 12.6 - Prob. 4QECh. 12 - Prob. 1CRPCh. 12 - Prob. 2CRPCh. 12 - Prob. 3CRPCh. 12 - In each of the following cases, write a program...Ch. 12 - Prob. 5CRPCh. 12 - Describe the function computed by the following...Ch. 12 - Describe the function computed by the following...Ch. 12 - Write a Bare Bones program that computes the...Ch. 12 - Prob. 9CRPCh. 12 - In this chapter we saw how the statement copy...Ch. 12 - Prob. 11CRPCh. 12 - Prob. 12CRPCh. 12 - Prob. 13CRPCh. 12 - Prob. 14CRPCh. 12 - Prob. 15CRPCh. 12 - Prob. 16CRPCh. 12 - Prob. 17CRPCh. 12 - Prob. 18CRPCh. 12 - Prob. 19CRPCh. 12 - Analyze the validity of the following pair of...Ch. 12 - Analyze the validity of the statement The cook on...Ch. 12 - Suppose you were in a country where each person...Ch. 12 - Prob. 23CRPCh. 12 - Prob. 24CRPCh. 12 - Suppose you needed to find out if anyone in a...Ch. 12 - Prob. 26CRPCh. 12 - Prob. 27CRPCh. 12 - Prob. 28CRPCh. 12 - Prob. 29CRPCh. 12 - Prob. 30CRPCh. 12 - Prob. 31CRPCh. 12 - Suppose a lottery is based on correctly picking...Ch. 12 - Is the following algorithm deterministic? Explain...Ch. 12 - Prob. 34CRPCh. 12 - Prob. 35CRPCh. 12 - Does the following algorithm have a polynomial or...Ch. 12 - Prob. 37CRPCh. 12 - Summarize the distinction between stating that a...Ch. 12 - Prob. 39CRPCh. 12 - Prob. 40CRPCh. 12 - Prob. 41CRPCh. 12 - Prob. 42CRPCh. 12 - Prob. 43CRPCh. 12 - Prob. 44CRPCh. 12 - Prob. 46CRPCh. 12 - Prob. 48CRPCh. 12 - Prob. 49CRPCh. 12 - Prob. 50CRPCh. 12 - Prob. 51CRPCh. 12 - Prob. 52CRPCh. 12 - Prob. 1SICh. 12 - Prob. 2SICh. 12 - Prob. 3SICh. 12 - Prob. 4SICh. 12 - Prob. 5SICh. 12 - Prob. 6SICh. 12 - Prob. 7SICh. 12 - Prob. 8SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Design a Turing machine that decides the language above by giving a high-level description of how it operates (how the head moves around, etc.); do not give an actual state diagram.arrow_forwardCreate a Turing machine for the language anbncmdm, where n,m > 0.arrow_forwardDesign a Turing machine that computes the function f (x) = x − 2 if x > 2 = 0 if x ≤ 2.arrow_forward
- Explain the formal definition of a Turing Machine by describing each component in clear and succinct language.arrow_forwardDesign a Turing machine that, when started scanning a square on a completely black tape, writes the string abab on the tape and halts scanning the leftmost symbol of this string. Try to design a machine that has no more than four states, q0 through q3.arrow_forwardDesign a Turing machine using no more than 4 states that when started with a blank tape prints out the string 0101 and then halts in the accepting statearrow_forward
- Generate a Turing machine that identifies language M = Make a state diagram and write the formal definition using M = (Q, Σ, Γ, δ, q, a, r) and write two examples of accepted words.arrow_forwardBuild a turing machine with three tracks that add two binary numbers. Considerate the data is stored in the first two tracks and aligned to the right. The result would be written to the third track which is initially empty. Make the ilustration of the turing machine and please explain all steps of the solution.arrow_forwardConstruct a Turing machine that copies the first three nonblank symbols over the next three blank symbols.arrow_forward
- Explain the formal description of a Turing Machine in clear and short words by describing each component of the formal description.arrow_forwardGive state diagram for Turing machine with one tape that recognizes the following language: A= {w ∈ {0, 1}∗ | w contains equal number of ones and zeros (in any order)}arrow_forwardConstruct a Turing machine that will accept language consists of all palindromes of 0's and 1'sarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning