Only do part c,d,e,f 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:9394(dacc, a, R)(arej, a, R)(9₁, b, R)(92, b, R)(arej, b, R)(qacc. b, R)(arej, *, R)(93.*, L)(94.*, L)(grej. *, R)(arej, *, R)(a) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initialconfiguration, it has executed zero steps.ab9⁰(9₁, a, R)*91(q₁, a, R)(92, b, R)92(92, a, R)(b) For how many steps does the Turing machine run on input string "a" before the Turing machine halts? Does the Turing machineaccept the string "a"?(c) Simulate the Turing machine on input "aaba". Does it accept? Draw the final two configurations of the Turing machinecomputation. In the last configuration, the Turing machine is either in the accept or reject state.(d) Simulate the Turing machine on input "aabb". Does it accept? Draw the final two configurations of the Turing machinecomputation. In the last configuration, the Turing machine is either in the accept or reject state.(e) Determine whether the Turing Machine accepts or rejects strings "bab" and "bba".(f) Describe in words the conditions under which the Turing machine accepts the input string.

A Turing machine comprises of a limitlessness long tape, which has been split into cells. Every cell…

(c) Simulate the Turing machine on input "aaba". Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (d) Simulate the Turing machine on input "aabb". Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (e) Determine whether the Turing Machine accepts or rejects strings "bab" and "bba".

(c) Simulate the Turing machine on input "aaba". Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (d) Simulate the Turing machine on input "aabb". Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (e) Determine whether the Turing Machine accepts or rejects strings "bab" and "bba".

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

RECURSIVE PYTHON The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Note: Use recursion and DO NOT use any loops. # TODO: Write recursive fibonacci() functiondef fibonacci(): if __name__ == "__main__": start_num = int(input()) print('fibonacci({}) is {}'.format(start_num, fibonacci(start_num)))
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: 9⁰ (9₁, a, R) b (92, b, R) (grej, *, R) 93 94 (qacc. a, R) (qrej, a, R) (arej, b, R) (qacc, b, R) (arej,*, R) (qrej, *, R) (a) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, it has executed zero steps. a 91 (9₁, a, R) * 92 (92, a, R) (9₁, b, R) (93, *, L) (92, b, R) (94*, L) (b) For how many steps does the Turing machine run on input string "a" before the Turing machine halts? Does the Turing machine accept the string "a"? (c) Simulate the Turing machine on input "aaba". Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (d) Simulate the Turing machine on input "aabb". Does it accept? Draw the final two…
Answer in python language only A very successful cinema director named "Chef" decided to solve the problem. When a customer wants to buy a ticket, the clerk at the ticket window asks the visitor if he or she needs a rest area, and if so, which one: left, right, or both. We know that in the audience they are expected to appear, their L needs a left-handed position, their R needs a right one, Z does not need a single one and B needs both. Your job is to count the number of people who can attend the show. In the theatre there are N rows with each M seat. There is only one lounge between the two adjacent seats. Seats at the beginning and end of the row have two armrests. Help him using the C++ programming language. Input 1 331209 Output: 8
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
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…
Write a recursive Fibonacci function that computes the Fibonacci number for input n and prints each value computed in the series at each recursive step in the sequence from 0 to n, all in one line on the console. (In python)
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?
Given the language, L = {abb, aabb, babb, aaabb, ababb...............,hich of the following is the correct the regular expression that can represent L. O A. (a+b)*ab B. (aa)*(bb)*b O C. (a*ba*) O D. (a+b)*abb
Calculating the Ackermann's function At the lectures we saw recursive functions. One of the most known recursive functions is Ackermann's function. In the basic form, this is a function of three arguments, but in the literature, we often use a derivative with two arguments: Péter and Robinson. !!!!!!!!!!!!!!!!!!USING A PEN AND PAPER!!!!!!!!!!!!!!! Compute the a (3, 3), write the solution on a paper.Scan the paper and jpg files (each sheet into a separate file). Archive all files into the zip archive and submit this file as a solution to the task!
Write recursive functions for the following equations:a. Harmonic number is defined by the equationb. Fibonacci numbers are defined by the formula:FN = FN-2 + FN-1, for N ≥ 2 with F0 = 0 and F1 = 1
An arithmetic sequence starts 2, 5, . . . Write a recursive definition for this sequence using function notation.
Write a recursive function to compute the following series: m(i) = 1 + 1/2 + 1/3 + . . . + 1/i Write a test program that displays m(i) for i 1, 2, ..., 10.