Build a TM that accepts a binary number and doubles it.
design a combinational circuit using suitable decoder that accepts 3 bit binary number generates an output binary number equal to square of input number.
Construct a TM Ms which decrements a binary number. The input to Ms is a string over (0,1). If the input is the base-2 representation of a positive integer number n, your TM must compute the base-2 representation of n-1. Otherwise your TM must reject the input. The output must have the same number of symbols as the input, which may have leading 0 symbols. The most significant bit of numbers is on the left. Submit a representation of M3...
Design a combinational circuit that accepts a 3-bit binary number input x and generates a 6-bit binary number output equal to the xth Fibonacci number F(x) = F(x-1) +F(x-2) where F(0) = 2 and F(1) = 3.The book we are using in class is this: http://www.cramster.com/logic-and-computer-design-fundamentals-4th-solutions-3631 and we are on chapter 3.
(10) Let L = { <M> | M is a TM that accepts sR whenever it accepts s } . Show that L is undecidable.
Construct a Turing Machine (TM) that accepts the following language, defined over the alphabet Σ = {0,1): at accepts the tollowing language, define [10] Give the transition diagram and explain the algorithm implemented by your TM.
Suppose you want to build a circuit that encodes a base 5 number to binary and then decodes the binary number to decimal. Complete the following a. Write the truth table for the base 5 to binary encoder b. Write Boolean expressions for all outputs of the binary encoder c. Write the truth table for the binary to decimal decoder d. Write Boolean expressions for all outputs of the binary encoder e. Draw the logic gate array for the entire...
Design a combinational circuit that accepts a 2-bit number and generates a 4-bit binary number output equal to the square of the input number. Use Decoder and any other external gates as necessary to implement your design. Draw the logic diagram and clearly label all input and output lines.
Consider a negative number detector which accepts a 5-bit signed-magnitude binary number A as input and outputs 1 if and only if A is a negative number. (hint: A can be written as A4A3A2AAo) (3096) Implement this circuit using: a. One AND gate and one OR gate b. One 4-to-2 priority encoder with valid bit
Draw the transition graph of a Standard Turing Machine (TM) that accepts the language: L = {(ba)^n cc: n greaterthanorequalto 1} Union {ab^m: m greaterthanorequalto 0} Write the sequence of moves done by the TM when the input string is w = bab. Is the string w accepted?
What's the minimum number of flip-flops needed to build a synchronous binary counter capable of counting from 0 to 17 inclusive?