Homework Answers
Add Answer to:
for the neXt paper 1. Please design a TM that takes a string of 1's and...
for the neXt paper 1. Please design a TM that takes a string of 1's and...
for the neXt paper 1. Please design a TM that takes a string of 1's and 0's as an input and accepts it if all 0's are placed after all 1's ad all 1's are placed before all 0's. For instance, 11000 would be accepted, but 110001 would be rejected, because the last 1 s not placed before all 0's
for the neXt paper 1. Please design a TM that takes a string of 1's and 0's as an input...
2. Please design a TM that takes a string of 0's and 1's as an input...
2. Please design a TM that takes a string of 0's and 1's as an input and appends 1 to the string if it starts with 1, otherwise t appends 0 to the end. Examples input 1000 output 10001 input 111 output 1111 input 0011 output 00110 input 0 output 00
2. Please design a TM that takes a string of 0's and 1's as an input and appends 1 to the string if it starts with 1, otherwise t...
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın gua...
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın guage of all palindromes over alphabet {a, b} . Please give both the high-level description (text description or pseudo-code algorithm) and the low-level state transition diagram. Please analyze how many steps (one transition is considered as a step) it takes to accept an input palindrome with n symbols . Please design a deterministic Turing machine with two semi-infinite tapes for the same language. Please give...
Design a system whose output goes high only after 8 consecutive 1's appear on the input;...
Design a system whose output goes high only after 8 consecutive
1's appear on the input; once the output goes high, it takes four
consecutive 0's on the input to make the output go low again. You
will use one switch as the input, and one button as the clock.
Assign a binary state code to each state of your FSM.
On a piece of paper, develop a truth table for the next state
and output logic.
On a piece...
Please use Python def findSubstrings(s): # Write your code here Consider a string, s = "abc"....
Please use Python
def findSubstrings(s):
# Write your code here
Consider a string, s = "abc". An alphabetically-ordered sequence of substrings of s would be {"a", "ab", "abc", "b", "bc", "c"}. If the sequence is reduced to only those substrings that start with a vowel and end with a consonant, the result is {"ab", "abc"}. The alphabetically first element in this reduced list is "ab", and the alphabetically last element is "abc". As a reminder: • Vowels: a, e, i,...
discrete math box answers do A and B please 2. For this problem, all strings are in the set (0,1) a) Design a Finit...
discrete math box answers do A and B please
2. For this problem, all strings are in the set (0,1) a) Design a Finite State Machine that accepts all and only the strings that (start with 0 and end with 1) or (start with 1 and end with 0). E.g. The following strings would be accepted: 010101, 001, 100, 101010, The following strings would not be accepted: 0110, 1010101, 1,0,.. b) Express the set of strings described above as a...
Design a system whose output goes high only after 8 consecutive 1's appear on the input;...
Design a system whose output goes high only after 8 consecutive
1's appear on the input; once the output goes high, it takes four
consecutive 0's on the input to make the output go low again. You
will use one switch as the input, and one button as the clock.
On a piece of paper, sketch an FSM diagram that solves the design problem. Make sure your FSM diagram meets the following requirements: - All states are properly specified. Each...
Write a function count_vowels(s) that takes a string as an argument and returns the number of...
Write a function count_vowels(s) that takes a string as an argument and returns the number of vowels ('a', 'e', 'i' 'o', 'u') in the string. Should you use a for or while loop? (Implement this as a function, not as a class with a method.) Be sure to include unittest test cases to demonstrate that your code works properly, e.g Part 2: last_occurance(target, sequence) Write a function last_occurance(target, sequence) that takes two arguments: 1. target: A target item to find...
This question deals with NFAs, DFAs, and regular expressions. (a) Using only the symbols described in...
This question deals with NFAs, DFAs, and regular expressions. (a) Using only the symbols described in the lecture slides, write a regular expression that describes all strings over the alphabet Σ = {0,1} that are at are at least four bits long and begin and end with the same bit. (b) Draw a DFA, that accepts strings strings over the alphabet Σ = {0, 1} such that if you read the string from left to right, the difference between the...
Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary.
#In Coral CHALLENGE ACTIVITY 7.1.1: Convert to binary. Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than e Output x % 2 (remainder is either e or 1) x= x / 2 Note: The above algorithm outputs the O's and 1's in reverse order. Ex: If the input is 6, the output is: 011 (6 in binary is 110; the...
for the neXt paper 1. Please design a TM that takes a string of 1's and 0's as an input and accepts it if all 0's are placed after all 1's ad all 1's are placed before all 0's. For instance, 11000 would be accepted, but 110001 would be rejected, because the last 1 s not placed before all 0's
for the neXt paper 1. Please design a TM that takes a string of 1's and 0's as an input...
2. Please design a TM that takes a string of 0's and 1's as an input and appends 1 to the string if it starts with 1, otherwise t appends 0 to the end. Examples input 1000 output 10001 input 111 output 1111 input 0011 output 00110 input 0 output 00
2. Please design a TM that takes a string of 0's and 1's as an input and appends 1 to the string if it starts with 1, otherwise t...
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın guage of all palindromes over alphabet {a, b} . Please give both the high-level description (text description or pseudo-code algorithm) and the low-level state transition diagram. Please analyze how many steps (one transition is considered as a step) it takes to accept an input palindrome with n symbols . Please design a deterministic Turing machine with two semi-infinite tapes for the same language. Please give...
Design a system whose output goes high only after 8 consecutive
1's appear on the input; once the output goes high, it takes four
consecutive 0's on the input to make the output go low again. You
will use one switch as the input, and one button as the clock.
Assign a binary state code to each state of your FSM.
On a piece of paper, develop a truth table for the next state
and output logic.
On a piece...
Please use Python
def findSubstrings(s):
# Write your code here
Consider a string, s = "abc". An alphabetically-ordered sequence of substrings of s would be {"a", "ab", "abc", "b", "bc", "c"}. If the sequence is reduced to only those substrings that start with a vowel and end with a consonant, the result is {"ab", "abc"}. The alphabetically first element in this reduced list is "ab", and the alphabetically last element is "abc". As a reminder: • Vowels: a, e, i,...
discrete math box answers do A and B please
2. For this problem, all strings are in the set (0,1) a) Design a Finite State Machine that accepts all and only the strings that (start with 0 and end with 1) or (start with 1 and end with 0). E.g. The following strings would be accepted: 010101, 001, 100, 101010, The following strings would not be accepted: 0110, 1010101, 1,0,.. b) Express the set of strings described above as a...
Design a system whose output goes high only after 8 consecutive
1's appear on the input; once the output goes high, it takes four
consecutive 0's on the input to make the output go low again. You
will use one switch as the input, and one button as the clock.
On a piece of paper, sketch an FSM diagram that solves the design problem. Make sure your FSM diagram meets the following requirements: - All states are properly specified. Each...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago