Design a synchronous lighted sign that flashes different colors based on an input L. When L is equal to 0, the sign should flash the following sequence; blue, green, red, and repeat. When L is equal to 1, the sign should flash the following sequence; yellow, off, red, off, yellow, off, red, off, and repeat. Assume the correct color will shine when the associated state is present. If the sign is in the blue or green state and the input L should change to 1, the next state should start the other sequence by transitioning to yellow first. If the sign is in yellow, off, or red states and the input L changes to 0, the next state should start the other sequence by transitioning to blue first.

Create the State Definition Table, State Diagram, Transition Table, combinational logic using Kmaps, and Final Equations assuming JK flip-flops and AND/OR/NOT combinational logic. For any additional binary states that don't exist in your state transition diagram, please solve for the next state using your JK equations and explain what the next state would be if the input was 0 or if the input was 1.

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

Lisa’s company, abc ltd., lost its biggest client and is now facing a financial crunch. most of her colleagues have resigned, but lisa decides to stay with the company and assist the management in overcoming the financial situation. which quality is lisa demonstrating? a. self-management b. cooperativeness c. responsibility d. loyalty

Which argument is not a valid filter? does not equal this quarter filter by cell color all of these are valid filter arguments.