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 13CRP
Program Plan Intro
Turing machine:
Turing machine is used as a tool to understand the power of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Question 7: Turing Machines
(a) Draw the state diagram of a Turing Machine, that converts every 'a' to 'b', and every 'b' to 'a',
except for the last alphabet. Also, it goes to the accept state if the last alphabet is 'a', and goes
to the reject state if the last alphabet is 'b'.
Hint: Convert everything until you reach the end (blank symbol), then take one step backward and
convert the last alphabet again. As you converted the last alphabet twice, it ensures that the last
alphabet was not changed. Then stop and depending on what the last alphabet is, now finally, go to
the accept or reject state.
subject theory of computer science
Given the language, L = {abb, aabb, babb, aaabb, ababb, …………..}, which of the following is the correct the regular expression that can represent L.
A.(a+b)*ab
B.(aa)*(bb)*b
C.(a*ba*)
D.(a+b)*abb
(a) There is a Turing machine that decides the set Ø
(b) There is a Turing machine that is not a decider and that recognizes the set Ø.
(c) There is a Turing machine that decides the set Σ*
(d) There is a Turing machine that is not a decider and that recognizes the set Σ*.
(e) There is a Turing machine that decides the set {ww | w€ [*}
(f) There is a Turing machine that is not a decider and that recognizes the set {www = [*}
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
- Artificial Intelligence (Part - 2) ==================== The Towers of Hanoi is a famous problem for studying recursion incomputer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (2) What is the size of the state space?arrow_forwardn 3n The language L is defined as L={a"b"c³" | n21} over the alphabet E={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing Machine. iii) Show the execution chain for the word aabbccccee.arrow_forward5. Write a Turing machine that computes the function f (n)=n mod3. You may submit a state-transition diagram or the delta-function definition.arrow_forward
- The language L is defined as L={a"b"c™ | n21} over the alphabet E={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing Machine. iii) Show the execution chain for the word aabbcccccc.arrow_forwardArtificial Intelligence (Part - 1) ==================== The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (1) Propose a state representation for the problem?arrow_forward(a) The Fibonacci sequence can also be seen in hurricanes prediction. The shape takes in the form of a spiral, it can be in a nesting process and repeated into infinity. It is called the logarithmic spiral, and it abounds in nature. The Fibonacci sequence of numbers, “Fn”, is defined using the recursive relation. Fibonacci sequence of numbers can be computed as follows: Fn = Fn-1+Fn-2 If the 12th and 13th terms in the hurricane prediction sequence are 89 km/hour and 144 km/hour, analyze the value of the 15th, 16th, and 17th hurricane speed by using the Fibonacci formula as stated above.arrow_forward
- Recursion can be direct or indirect. It is direct when a function calls itself and it is indirect recursion when a function calls another function that then calls the first function. To illustrate solving a problem using recursion, consider the Fibonacci series: - 1,1,2,3,5,8,13,21,34...The way to solve this problem is to examine the series carefully. The first two numbers are 1. Each subsequent number is the sum of the previous two numbers. Thus, the seventh number is the sum of the sixth and fifth numbers. More generally, the nth number is the sum of n - 2 and n - 1, as long as n > 2.Recursive functions need a stop condition. Something must happen to cause the program to stop recursing, or it will never end. In the Fibonacci series, n < 3 is a stop condition. The algorithm to use is this: 1. Ask the user for a position in the series.2. Call the fib () function with that position, passing in the value the user entered.3. The fib () function examines the argument (n). If n < 3…arrow_forward3. Read from Figure 1: Turing Machine 1 the description of turing machine and for how many steps does the Turing machine run on input string "a" before the Turing machine halts? Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 91, 92, 93, 94, 9acc, grej} The transition function is given in the table below: a b * 91 92 (91, a, R) (92, a, R) (q1, b, R) (q2, b, R) (93, *, L) (94, *, L) Figure 1: Turing Machine 1. 9⁰ (9₁, a, R) (92, b, R) (grej, *, R) A. 1 step B. 2 steps C. 3 steps D. 4 steps E. None of the above. 93 (qacc, a, R) (arej, b, R) (grej, *, R) 94 (qrej, a, R) (qacc, b, R) (grej, *, R)arrow_forwardProblem 4 Turing Machines Construct a Turing machine that recognizes the set of all bit strings that contain at least two l's. You need to define the state transition table in the format used in lectures. That is, f(s;, a) = (s;, A, R) where s; is the current state, s; is the next state, a is the input symbol, A is the output symbol written on tape, and L indicates moving left or R indicates moving right.arrow_forward
- 4. Design a Turing machine with alphabet {a, b, c} that accepts strings with the following properties: i. You see immediately the substring aaa after you see the first c ii. The machine accepts a string, only if it contains a carrow_forwardUsing a repetition construct, display the following on the screen (warm-up problem). L P P Larrow_forwardThe language L is defined as L={an b n c 3n | n≥1} over the alphabet Σ={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing Machine. iii) Show the execution chain for the word aabbcccccc.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning