Design the minimum-state DFA that accepts all and only the strings of 0's and 1's that have 110 as a substring. To verify that you have designed the correct automaton, we will ask you to identify the true statement in a list of choices. These choices will involve:   The number of loops (transitions from a state to itself). The number of transitions into a state (including loops) on input 1. The number of transitions into a state (including loops) on input 0. Count the number of transitions into each of your states ("in-transitions") on input 1 and also on input 0. Count the number of loops on input 1 and on input 0. Then, find the true statement in the following list.        a)  There is one state that has two in-transitions on input 0.      b)  There is one state that has one in-transition on input 0.      c)  There are two states that have one in-transition on input 0.      d)  There are two loops on input 0 and two loops on input 1. it can only be one of these answers it cant be two

Suppose that you are given n red and n blue water jugs, all of different shapes and sizes. Allred jugs hold different amounts of water, as do the blue ones. Moreover, for every red jug,there is a blue jug that holds the same amount of water, and vice versa.Your task is to find a grouping of the jugs into pairs of red and blue jugs that hold the sameamount of water. To do so, you may perform the following operation: pick a pair of jugs inwhich one is red and one is blue, fill the red jug with water, and then pour the water into theblue jug. This operation will tell you whether the red or the blue jug can hold more water, orthat they have the same volume. Assume that such a comparison takes one time unit. Yourgoal is to find an algorithm that makes a minimum number of comparisons to determine thegrouping. Remember that you may not directly compare two red jugs or two blue jugs.(a) Describe a deterministic algorithm that uses Θ(n2) comparisons to group the jugs intopairs.(b) Give a…

Help me with my computational theory class homework

Each time a component is tested, the trial is a success (S) or failure (F). Suppose the component is tested repeatedly until a success occurs on three consecutive trials. Let Y denote the number of trials necessary to achieve this. List all outcomes corresponding to the five smallest possible values of Y. (Enter your answers in set notation.)   what is the answer for Y=7.    I have {SFFFSSS,SSFFSSS,FFFFSSS,FSSFSSS,FSFFSSS. Are there more?

Create a multiplicative Cayley table for Q

Show that A8 contains an element of order 15.

Tweet,  a quality control engineer of a large computer firm, inspects a large shipment of printed circuit boards (PCBs). The shipment of 1000 PCBs were inspected for defects, such as misplaced components or the application of too much solder paste. Tweet found that 750 of the PCBs have no defects, 100 have one defect each, 75 have two defects each, 50 have three defects each, and the rest have 5 defects each. Let X be the number of defects found in a PCB. What is P(X =2)? Group of answer choices

Simplify the following Boolean functions and construct the corresponding circuit. a. F= A'C + A'B + AB'C + BC b. F= A'B'C' + B'CD' + A'BCD' + AB'C'

Please help with b and c

Find the number of arrangements of the word LEARNING where every vowel has at least one conso-nant beside it (either directly on its left, or directly on its right, or both).