Give a transducer TM that takes #bi as input and computes #bi+1, where i is an integer and i>0, and bt is a binary representation of t, for an integer t. For example, if #001 is on the tape as input, then after the TM has executed, the tape should contain #010 in the leftmost cells, with infinite blanks after it. You can assume that the input alphabet is {#,0,1}. If the input is badly formed (e.g., #01# has too many #'s), then the TM can "hang" or go to qr.

Give a transducer TM that takes #bi as input and computes #bi+1, where i is an integer and i>0, and bt is a binary representation of t, for an integer t. For example, if #001 is on the tape as input, then after the TM has executed, the tape should contain #010 in the leftmost cells, with infinite blanks after it. You can assume that the input alphabet is {#,0,1}. If the input is badly formed (e.g., #01# has too many #'s), then the TM can "hang" or go to qr.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

You are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assmue that the positions of bits count from right to left.That is, the first bit is the least significant bit.
Modulo arithmeticFor two integers ‘a’ and ‘b’ and a positive integer ‘n’, let + represent the operation a + b = (a+b)mod(n), that is, the result of a + b is the remainder of the usual sum a + b after dividing by n (using a natural representation). Similarly, let * represent the operation a * b = (a*b)mod(n), that is, the result of a * b is the remainder of the product a*b after dividing by n. For example using the set S = {2, 5, 8} and n = 9, 5 + 8 = 4, since 4 is the remainder after dividing 13 (5 + 8) by 9; and 2 * 8 = 7, since 7 is the remainder after dividing 16 (2*8) by 9.a. For each set S and number n specified below, create two “operation” tables (these are called Cayley tables), one showing the results for the operation +, and one showing the results of the operation * for each pair of elements from S (see the example tables in the notes).i. S1 = {0, 1} and n = 2ii. S2 = {1, 2} and n = 3iii. S3 = {0, 2, 4, 6} and n = 8iv. S4 = {1, 3, 5, 7} and n = 8v. S5 = {1, 2, 3, 4} and n =…
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assume that the positions of bits count from right to left.That is, the first bit is the least significant bit.data_a DCD 0x77FFD1D1data_b DCD 0x12345678
implement byteSwap(x,n,m) Swap the m and n byte of x /* * byteSwap - swaps the nth byte and the mth byte* Examples: byteSwap(0x12345678, 1, 3) = 0x56341278* byteSwap(0xDEADBEEF, 0, 2) = 0xDEEFBEAD* You may assume that 0 <= n <= 3, 0 <= m <= 3* Legal ops: ! ~ & ^ | + << >>* Max ops: 25*/ int byteSwap(int x, int n, int m) {return 2;}
3. Write a program to evaluate a polynomial \[ p(x)=c_{n} x^{n}+c_{n-1} x^{n-1}+\cdots+c_{2} x^{2}+c_{1} x+c_{0} \] and its derivative at a given pointt. The input is the row vectorcof coefficients of the polynomial arranged from highest to lowest power, and the numbert, and the two outputs arep(t)andp′(t). Computep(t)by first computing the row véctor \[ \left[t^{n}, t^{n-1}, \ldots, t^{2}, t, 1\right] \] and combine that with the vectorcto get the result. Computep′(t)by computing the coefficients of the derivative polynomial from the vectorc, and then evaluating that polynomial in the same way. Include some tests that provide evidence that your code produces the correct results. Please give proper explanation and typed answer only.
Implement a class RLE that uses fixed-length encoding, to compress ASCII bytestreams using relatively few different characters, includingthe code as part of the encoded bitstream. Add code to compress() to make a stringalpha with all the distinct characters in the message and use it to make an Alphabet foruse in compress(), prepend alpha (8-bit encoding plus its length) to the compressedbitstream, then add code to expand() to read the alphabet before expansion.
Write a program that takes in two positive integer inputs, m and n, and prints out a neatly formatted table of size m * n of all integers between 1 and m in n rows. For example; m = 3, n = 4 1 2 3 1 2 3 1 2 3 1 2 3 Please help me with this problem using c++.
Implement the quadratic_formula() function. The function takes 3 arguments, a, b, and c, and computes the two results of the quadratic formula: x1=−b+b2−4ac2a x2=−b−b2−4ac2a The quadratic_formula() function returns the tuple (x1, x2). Ex: When a = 1, b = -5, and c = 6, quadratic_formula() returns (3, 2). Code provided in main.py reads a single input line containing values for a, b, and c, separated by spaces. Each input is converted to a float and passed to the quadratic_formula() function. Ex: If the input is: 2 -3 -77 the output is: Solutions to 2x^2 + -3x + -77 = 0 x1 = 7 x2 = -5.50 code: # TODO: Import math module def quadratic_formula(a, b, c):# TODO: Compute the quadratic formula results in variables x1 and x2return (x1, x2) def print_number(number, prefix_str):if float(int(number)) == number:print("{}{:.0f}".format(prefix_str, number))else:print("{}{:.2f}".format(prefix_str, number)) if __name__ == "__main__":input_line = input()split_line = input_line.split(" ")a =…
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and prints an m-by-n grid of cells with k mines, using asterisks for mines and integers for the neighboring mine counts (with two space characters between each cell). To do so, Generate an m-by-n grid of cells, with exactly k of the mn cells containing mines, uniformly at random. For each cell not containing a mine, count the number of neighboring mines (above, below, left, right, or diagonal)