Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 91, 92, 93, 94, 9aco, arej} The transition function is given in the table below: 90 93 94 (9₁, a, R) (qacc. a, R) (qrej, a, R) b (92, b, R) (9₁, b, R) (92, b, R) (arej, b, R) (qacc, b, R) (grej. *, R) (93.*, L) (94.*, L) (arej. *, R) (grej. *, R) (a) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, has executed zero steps. * 91 (9₁, a, 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 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 configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (e) Describe in words the conditions under which the Turing machine accepts the input string.

Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 91, 92, 93, 94, 9aco, arej} The transition function is given in the table below: 90 93 94 (9₁, a, R) (qacc. a, R) (qrej, a, R) b (92, b, R) (9₁, b, R) (92, b, R) (arej, b, R) (qacc, b, R) (grej. , R) (93., L) (94., L) (arej. , R) (grej. , R) (a) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, has executed zero steps. 91 (9₁, a, 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 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 configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state. (e) Describe in words the conditions under which the Turing machine accepts the input string.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

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?
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)))
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
Part IV An early method of telegraph communication was based on the Morse code. This code uses patterns of short and long pulses to represent a message. Each letter is represented as a sequence of dots (a short pulse), and dashes (a long pulse). For example, the first eight letters of the alphabet have the following representation: A In HDL Verilog В C D E F G H Design and implement a circuit that takes as input one of the first eight letters of the alphabet and displays the Morse code for it on a red LED. Your circuit should use switches SW2-o and pushbuttons KEY1 a user presses KEY1, the circuit should display the Morse code for a letter specified by SW2-0 (000 for A, 001 for B, etc.), using 0.5-second pulses to represent dots, and 1.5-second pulses to represent dashes. Pushbutton KEY, should function as an asynchronous reset. A high-level schematic diagram of the circuit is shown in Figure 2. (1-0 as inputs. When Hint: Use a counter to generate 0.5-second pulses, and another counter…
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: **** *** ** * ** *** ****
Write a program that performs the following functionalities:1. Fibonacci: a recursive function that computes the fibonacci series, which is defined as followsfibonacci (n) = fibonacci(n-2) + fibonacci(n-1)fibonacci(0) = 0fibonacci(1) = 1 So the fibonacci looks like: 0 1 1 2 3 5 8 13 21 34 …. Therefore, fibonacci(4) = 3, fibonacci(5) = 5, fibonacci(7)=13 2. Sum: a recursive function that computes the sum of integers 1, 2, 3, …., n for a given number n. So Sum(6) should return 1 + 2 + 3 + 4 + 5 + 6 , i.e. 21.sum(n) = n + sum(n-1) 3. Largest: a recursive function that computes the largest value for an integer array of positiveand negative values. For example, for the array below, the function largest should return 22,which is the largest value in the array. You can assume there are no more 20 integers in thearray. Think of how to formulate the recurrence relation in this problem yourself. 4. The 4th problem mimics the situation where eagles flying in the sky can be spotted and…
Exercise 1: The number of combinations CR represents the number of subsets of cardi- nal p of a set of cardinal n. It is defined by C = 1 if p = 0 or if p = n, and by C = C+ C in the general case. An interesting property to nxC calculate the combinations is: C : Write the recursive function to solve this problem.
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…
CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021
using recursion python Consider the English alphabet consisting of 26 lowercase letters: a, b, c, · · ·, x, y, z. • To this order, letters appear earlier are defined smaller. For example, the letter a is smaller than the letter b, and z is the largest letter since it appears last in the alphabet. • The least letter of an English word is the smallest letter that appears in that word. For example, the least letter of “Saturday” is “a”, and the least letter of “hello” is “e”. You are asked to write a program consisting of a function and a main interface as follows. (a) function recur_least_letters(l): Goal: collects all the least letters of words in list l (one least letter for each word) and returns the string of the obtained least letters in the order that the corresponding words appear in list l. • Input: a list l of English words • Output: string of all the least letters of words appearing in list l • Example: input: l = [‘today’, ‘is’, ‘saturday’] → output: “aia” Recursion is…
Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the following property, which holds for positive integers p and q: If p > q, the gcd of p and q is the same as the gcd of q and p % q.
Write a recursive function called that takes a string of single names separated by spaces and prints out all possible combinations (permutations), each combination on a new line. When the input is: Alice Bob Charlie then the output is: Alice Bob Charlie Alice Charlie Bob Bob Alice Charlie Bob Charlie Alice Charlie Alice Bob Charlie Bob Alice Here is the original code in Python: def all_permutations(permList, nameList): # TODO: Implement method to create and output all permutations of the list of names. pass if __name__ == "__main__": nameList = input().split(' ') permList = [] all_permutations(permList, nameList)