Handwritten please. Create Turing machines based on the following specifications. The Turing machine must be expressed as files that can be used as inputs for the Turing machine simulator described below. Design a Turing machine on the input alphabet {d,e,f}{d,e,f} that accepts strings represented using this Python regular expression that uses back references: r'^([de]*)f\1$' For this machine, the final tape output does not matter. You will need to modify the tape in order to complete this exercise.

Handwritten please. Create Turing machines based on the following specifications. The Turing machine must be expressed as files that can be used as inputs for the Turing machine simulator described below. Design a Turing machine on the input alphabet {d,e,f}{d,e,f} that accepts strings represented using this Python regular expression that uses back references: r'^([de]*)f\1$' For this machine, the final tape output does not matter. You will need to modify the tape in order to complete this exercise.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

Create a single tape Turing machine that has the alphabet a, b, c and null. Submit a .jff file of your solution. This Turing machine begins with (a+b+c)* and ends with a tape content of (abc)* e.g. abcabcabc... if there are extra characters, for example extra b's, erase them. Maximize the number of abc substrings.
Applying object oriented programming, do a python program that will determine the required mass of one compound based on three parameters: (1) compound name, (2) liters of solution, and (3) molarity. The input should be in a single text file (input.txt). The required mass should be in a single text file (output.txt). Only two decimal places should be included in the output.txt. Example: *input.txt* compound,liter,molarity NH4Cl, 0.1, 2.5 NaCl, 0.5, 0.25 Na2CO3, 0.75, 1.25 *output.txt* 13.37 7.31 99.36
Using Java, write a simple program to print all integers from 1-2000 to separate text files in numerical order, reverse order, and randomly generated (no duplicates). Please enter one data entry per line so that another program will be able to read from this file.
Write the Recurrent Neural Networks in Python for a csv file with product reviews. Ensure that the code is commented line by line. Use existing libraries to output the name of the algorithm, the accuracy precision, recall, F1 score, confusion matrix, means square error, train test split, and class report.
Write a 2 tape Turing machine that converts its input from binaryto unary. In other words, if the input is the string x ∈ {$, 0, 1}∗, a $ followed by thebinary expansion of the nonnegative integer n (for example, $101 to represent n = 5), thenthe machine outputs the string 1^n(e.g., 1^5 = 11111). You may assume the input stringwill be in this format, i.e., a $ followed by either just a 0, or followed by a binary stringbeginning with 1.
Write a program to read several lines from a file. For each line, check (recursively) whether it is a palindrome. If it is a palindrome output the original string preceded by an integer (a counter) , like this: 1 : Sore was I, ere I saw Eros.2 : A man, a plan, a canal -- Panama Recall that a palindrome is a String that is the same backwards and forwards. Some examples of single words that are palindromes are: level, madam, racecar Phrases can also be palindromes if you strip out all the whitespace and punctuation and make everything the same case. Some examples are: Madam, I'm Adam A Toyota's a Toyota (See the palindrome video for more) You will need one method to eliminate whitespace and punctuation , make everything lowercase, and return the new string. Use the recursive method you wrote in L15Num2. This returns a string with no whitespace or punctuation, but not all the same case. Then (in main) convert that string to lowercase. You need a recursive method that takes the new…
Create a Turing machine that when started anywhere on the tape will halt if and only if there is a 0 somewhere on the tape., since it only lets you enter a single input string as the starting configuration of the tape. （For this problem, the tape can start with 0s and 1s scattered anywhere on the tape - they do not have to be contiguous. Any permutation of 0s, 1s and blanks is a possible starting configuration.）
How many different objects of type integer exist in the computer’s memory after the following code has been executed? Assume that no garbage collection has been executed and that no optimizations have been performed. (Python) x, y = 5, 10 x = x * 5 y = x z = 5 A) 3 B) 6 C) 4 D) 5 E) 2
Write a python code that does the following: - Asks student to enter his name - Ask them to enter their marks for 4 different modules. (Note: these marks should be out of 100 for each module) - Based on the average of the 4 different modules, the student should get the grade that they have achieved at that level. - The grades should follow the following trend - greater than or equal to 90 = A - from 80 to 89 inclusive = B - from 70 to 79 inclusive = C - from 60 to 69 inclusive = D - from 50 to 59 inclusive = E - below 50 = F
Write a Python program in a Linux/UNIX script called myprogram.py. Write a Python program that continuously (i.e., in an infinite loop) asks the user for a number m. At each iteration of the loop, check in parallel whether m is greater than 10, greater than 20, and greater than 30. Make sure that the three comparisons may be performed in parallel (i.e., so that the three outputs can theoretically be printed in any order). Use the smallest number of processes. Make sure you don’t create zombie processes. Use the code below as a template. Use this template: from os import wait,waitpid,fork # write your code here while (True): #make sure to indent this and the next lines m=float(input('Give me a number: ')) # your code here
Correct answer will be upvoted else downvoted. Computer science. Presently Nezzar has a beatmap of n particular focuses A1,A2,… ,An. Nezzar might want to reorder these n focuses so the subsequent beatmap is great. Officially, you are needed to find a change p1,p2,… ,pn of integers from 1 to n, to such an extent that beatmap Ap1,Ap2,… ,Apn is great. In case it is unthinkable, you ought to decide it. Input The primary line contains a solitary integer n (3≤n≤5000). Then, at that point, n lines follow, I-th of them contains two integers xi, yi (−109≤xi,yi≤109) — directions of point Ai. It is ensured that all focuses are unmistakable. Output In case there is no arrangement, print −1. In any case, print n integers, addressing a legitimate change p. In case there are numerous potential replies, you can print any.
Python: Each output is suppossed to have a space after, including the last one. How do I do this?