Descrete Math Create a turing machine that has a string of n 1s as input and...
Descrete Math
Create a turing machine that has a string of n 1s as input and outputs a string of 2n 1s. Showing the steps test your machine on the input 1111.
Homework Answers
Add Answer to:
Descrete Math
Create a turing machine that has a string of n 1s as input and...
Turing machine that subtracts two from the input string corresponding a ternary number.
Implement a Turing machine that subtracts two from the input string corresponding a ternary number. More specifically, suppose w = an−1an−2 . . . a1a0 is the input string with ai ∈ {0, 1, 2}. Your Turing machine should subtract two from w “in-place”, i.e., at the end of the computation the tape should contain the result, w − 2 and the tape head should be at the start of that string. Upon a successful operation, halt on accept. Otherwise,...
can someone help me with this problem? thanks Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101. Prove that there is n...
can someone help me with this problem? thanks
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
5. Design a Turing machine that takes as input two numbers a and b, such that...
5. Design a Turing machine that takes as input two numbers a and b, such that a is not equal to b and determines which number is higher. Give the transition table for the machine. Show by drawing the steps, how the machine works when a-3 and b-2. Can we use a PDA for the same problem? Give reasons for your answer (10+5+5-20).
Describe a Turing Machine that will read its input tape as a binary number n and...
Describe a Turing Machine that will read its input tape as a binary number n and produce on its tape the binary representation of n + 1. That is, the TM will be a subprogram that will add one to an input number. This description could be a formal TM that does what is asked. It could also be slightly less than totally formal provided it is crystal clear what is happening.
4. Create a 1-hot implementation of the traffic light state machine from problem #2 (a) Create the state table with state assignments, showing the next states as a function of the input and the outpu...
4. Create a 1-hot implementation of the traffic light state machine from problem #2 (a) Create the state table with state assignments, showing the next states as a function of the input and the outputs as a function of the present state. (b) Determine the logic equations for the next state inputs to the flops, and for the six output control signals.
4. Create a 1-hot implementation of the traffic light state machine from problem #2 (a) Create the state...
Discrete Mathematical Structures Draw a Turing machine that takes a string representing two unary numbers, x...
Discrete Mathematical Structures
Draw a Turing machine that takes a string representing two unary numbers, x and y, separated by a 0, and determines whether x greaterthanorequalto y. For example, the input for x = 3, y = 4 would be 11101111. Use two halt states: one for yes and one for no. Give the trace of your machine in the previous problem processing the strings 11101111 and 11110111. Draw a TM that computes f(w) = w^R where w elementof...
Create a state machine that outputs a high signal every time the string ‘001’ is detected....
Create a state machine that outputs a high signal every time the string ‘001’ is detected. Use only four states in your state machine, and two JK flip-flops in your circuit design. As an example, ‘1101000010100011101’ should output a high signal two times.
Show that the language A = {<M1> | the language accepted by the Turing Machine M1...
Show that the language A = {<M1> | the language
accepted by the Turing Machine M1 is 1*} is
not decidable. Present your proof in the style of the proof of Th.
5.3, which shows below.
PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
Consider a finite state machine with a control input called mode. When mode = 0, the...
Consider a finite state machine with a control input called mode. When mode = 0, the machine operates as a mod-3 down counter, where the outputs are the count values. When mode = 1, the machine's output progresses through 1133 number (1 digit per clock cycle). Complete each of the steps which follow. (a) Draw the state diagram for this machine. (b) Write RTL Verilog code which implements this design. Submit your printed source code by the due date and...
Step 2: Create the method specified below. static int GetValidWidth(string prompt) Input parameters prompt: message for...
Step 2: Create the method specified below. static int GetValidWidth(string prompt) Input parameters prompt: message for user describing the input required Returns A non-zero width entered by the user Step 3: Create the method specified below. static int GetValidHeight(string prompt) Input parameters prompt: message for user describing the input required Returns A non-zero positive height entered by the user Step 4: Create the method specified below. static void DisplayBox(int width, int height, char fillChar) Input parameters width: width of each...
can someone help me with this problem? thanks
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
Prove that there is no algorithm that determines whether an arbitrary Turing machine halts when run with the input string 101.
5. Design a Turing machine that takes as input two numbers a and b, such that a is not equal to b and determines which number is higher. Give the transition table for the machine. Show by drawing the steps, how the machine works when a-3 and b-2. Can we use a PDA for the same problem? Give reasons for your answer (10+5+5-20).
4. Create a 1-hot implementation of the traffic light state machine from problem #2 (a) Create the state table with state assignments, showing the next states as a function of the input and the outputs as a function of the present state. (b) Determine the logic equations for the next state inputs to the flops, and for the six output control signals.
4. Create a 1-hot implementation of the traffic light state machine from problem #2 (a) Create the state...
Discrete Mathematical Structures
Draw a Turing machine that takes a string representing two unary numbers, x and y, separated by a 0, and determines whether x greaterthanorequalto y. For example, the input for x = 3, y = 4 would be 11101111. Use two halt states: one for yes and one for no. Give the trace of your machine in the previous problem processing the strings 11101111 and 11110111. Draw a TM that computes f(w) = w^R where w elementof...
Show that the language A = {<M1> | the language
accepted by the Turing Machine M1 is 1*} is
not decidable. Present your proof in the style of the proof of Th.
5.3, which shows below.
PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
Most questions answered within 3 hours.
-
3. (10 pts) You grow a corn crop that yields 150 bushels ac-1,
with the following...
asked 5 minutes ago -
7. The term Six Sigma refers to:
Select one:
a. The control limits established in a...
asked 15 minutes ago -
Wildhorse Company follows the practice of pricing its inventory
at the lower-of-cost-or-market, on an individual-item
basis....
asked 17 minutes ago -
For the following reaction: A(g) + 2 B(g) ⇌ 2 C(g) Calculate the
equilibrium constant K...
asked 17 minutes ago -
Which of the following best describes tidal volume? options:
1.The amount of oxygen in the air...
asked 34 minutes ago -
1. Smaller cost distortions occur when the traditional systems'
single indirect-cost rate and the activity-cost-driver rates:...
asked 42 minutes ago -
Using either a FMECA approach or some other appropriate RCA
tool, identify five risk treatment actions...
asked 42 minutes ago -
If for a test the P-value is between 0.0025 and 0.005, what
conclusion can you draw?...
asked 54 minutes ago -
Using Python. Write a function clean2(aList) that takes a list
of integers aList as argument, and...
asked 1 hour ago -
Intrapreneurship is defined as the
development of an enterprise culture with an existing (Nandan,
2009). An...
asked 1 hour ago -
QUESTION 1 Tamiflu is a drug used to treat influenza. A study
found that Tamiflu reduced...
asked 1 hour ago -
Which of the following would be less likely to be used to
allocate factory overhead when...
asked 1 hour ago