Q2: A sequential network has one input and one output. The output becomes 1 when either M or N is detected in its input where M and N are binary numbers. Otherwise, it gives 0 in its output. Draw the state diagram for the following: 1. M = 11 and N-00 (use mealy model). 2. M = 01 and N=11 (use mealy model). 3. M-10 and N = 11(use mealy model). 4. M 01 and N= 10 (use mealy model). 5. M-01 and N= 10 (use moore model).

Q2: A sequential network has one input and one output. The output becomes 1 when either M or N is detected in its input where M and N are binary numbers. Otherwise, it gives 0 in its output. Draw the state diagram for the following: 1. M = 11 and N-00 (use mealy model). 2. M = 01 and N=11 (use mealy model). 3. M-10 and N = 11(use mealy model). 4. M 01 and N= 10 (use mealy model). 5. M-01 and N= 10 (use moore model).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Draw the state diagram of a TM that will accept all binary strings that contain as many 0s as there are 1s. For example, 10100101 and 00101101 are acceptable, but 0100100 is not acceptable. The reject state need not be shown.
Q5. A. A Mealy sequential circuit has one input (X) and one output (Z). The circuit should transmit its input, except that it should prevent the sequence 00110 from occurring. So Z should be the same as X, except that if the input sequence 00110 occurs, Z should be 1 rather than 0 when the last 0 is received, so that the sequence X = 00110 is replaced with Z= 00111. Derive only the state graph, and the state table. Solution:
A combinational circuit that has 4-inputs (a, b, c, d) and 4-outputs (w, x, y, z); the inputs (a, b, c, d) represent a 2 binary numbers N₁ and N₂, where N₁= ab and N₂=cd; and the output (w, x, y, z) represent N₁* N₂. For example, when abcd=1001, the output wxyz=0010. a. Construct the truth table. b. Find the Maxterm expansion of w in decimal notation. c. Find the Minterm expansion of x in decimal and algebraic notation. d. Find the Maxterm expansion of y in decimal form. e. Find the Minterm expansion of z in decimal notation a b c d w x y z
Suppose we're modelling an RC crane which is receiving a sequence of input commands, each of which is UP, DOWN, or BEEP. This crane has only two vertical positions, and starts in the high position. It should go into an ERROR end state if it is asked to go UP when it is in the high position or DOWN when it is in the low position. Once it is in the ERROR state, it stays in the ERROR state no matter what commands it receives. BEEP commands are legal at any point. Give a state diagram for this system, in which each edge corresponds to receiving a single command.
QUESTION 2 Let M= (Q. E, I, qo, õ, y) be a Finite State Machine(FSM) such that the Transition table of M is Y States a b a b Ob 93 91 1 1 91 42 91 1 92 40 93 1 93 42 Ob 94 91 92 1 a. Draw the Transition Diagram of M b. What is the output string produced for the following input string? i. bbbabab ii. aababab
In this and the following question, consider those TMs that satisfy all of the following properties: Q={90,91,9a9r}: there are exactly two states besides the accept state and the reject state. • Σ={1}: the input alphabet has just one symbol. • [={1,_}: the tape alphabet has two symbols, where is the blank symbol. • The head is moved in every step, that is, 8 uses only L and R, but not N. • If the machine is started on the completely empty tape, it will halt after a finite number of steps, that is, it will reach qa or qr. If such a TM is started on the completely empty tape, it will leave a certain number of 1 symbols on the tape after it halts. What is the maximum number of 1 symbols on the tape, among all of these TMs? Answer: Check Consider again the TMs of the preceding question. If such a TM is started on the completely empty tape, it will make a certain number of transition steps. What is the maximum number of steps, among all those TMs? Answer: Check
QI/Consider the FSM whose state table is shown below, reduce it by using implication chart Next state X-0 X=1 Present state Output X=1 X=0 8 3 8 6. 8 4 8 4 7 4 2 4 8 5 4
A sequential circuit has one input X and four outputs Z₁ Z₂ Z3 Z4. Z1 Z2 Z3 Z4 represents the gray code encoded number equal to the number of pairs of adjacent 1's that have been received as inputs. Use the gray code that is on page 22 of the textbook. For example, if the circuit had received 7 pairs of 1's as inputs, Z₁ Z2 Z3 Z4 = 1011. In addition, the circuit resets when the circuit receives 5 pairs of 1's. Find a Moore state graph and table for the circuit. Examples Input sequence: Output sequences: X = 1 0 1 1 1 0 0 1 1 0 1 1 0 1 0 1 1 10 Z₁ = 0 0 0 0 0 0000000000100 Z₂ 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 Z3 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 - Z4 = 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 X 11111111 Input sequence: Output sequences: Z₁ = 0 0 0 0 0 100 Z2 0 0 0 0 1 100 = Z3 = 0 0 1 1 1 1 0 0 Z4 0 1 1 0 0 0 0 1 =
Suppose the state machine shown below is in State A and receives the string 10010100. What is its output? Choose the correct answer and show all your intermediate steps to receive full points. A) 00 10 11 10 00 01 11 10 11B) 10 11 10 00 01 11 10 11 10C) 00 10 11 00 01 11 01 11 01D) 10 11 10 10 11 10 11 10 10
Suppose we wish to design a car security system that operates as follows: • There are only two states: "siren off" and "siren on" • There is one combinational output: 0 - lights not flashing or 1 - lights flashing. • There are three combinational inputs: M(master), D(door), and V(vibration). Use the names M, D, and V for these inputs in the given order MDV. • M: 0 - off, 1 - on • D: 0 - door closed, 1 - door opened • V:0 - no vibration detected, 1 - vibration detected The circuit works as follows: • If the siren is currently off, it is turned on and the lights flash when the master is on and either the door is opened or vibration is detected. (This is a regular or, not an exclusive or). • If the siren is currently off, it will remain off and the lights will not flash when either the master remains off or if the master is on but neither the door is open not vibration is detected. • If the siren is currently on, it will remain on and the lights will flash as long as the master is on. •…
Using deapth-first strategy, write a python code for a roomba machine to display when it is on the charging state and when it is on the cleaning state when passing through each node of these noted that when its level of charge become less than 6 it converts from the cleaning to the charging states and its cleaning station is on the 12th node .
Please written by computer source An LSTM with a single hidden layer has 2 neurons in all its gates. The forget gate weight matrix (Wf), the input gate weight matrix (Wi) and the output gate weight matrix (Wo) are all given. Wf=Wi=Wo=[[-0..8, 0, -0.3,-0.75, 0.26, 0.09];[0.05, -0.1, -0.9, 0, 0.85, 0.07]].Where the first two columns are the weights for the CEC memory (i.e Wfc/Wic/Woc) the following two columns are weights for hidden memory (i.e Wfh/Wih/Who) and the last two columns are weights for the input (i.e Wfx/Wix/Wox). The input pattern detection weights Wc are given by The input pattern detection weights Wc are given by Wc = [[0.8, 0.9, 0.3, 1];[0.3, 0.45, 0.7, 0.5]]. Where the first two columns are the weights for the hidden vector (Wch) and the following two are the weights for the input (Wcx). Let us define the “memory duration” of the network as the minimum number of time steps N such that for an isolated input at time t (with no previous or subsequent inputs) the length of…