In a group of four machines {0, 1, 2, 3, 5} machines 0 and 1 send messages simultaneously via multiple unicasts to the group. In this context, explain Global ordering, causal ordering and partial ordering approaches for time ordering, and compare them.

Hi, This part is about regular expressions (REs) and finite-state automata (FSAs). Notation: in the REs below, the Kleene star has higher precedence than sequencing; andsequencing has higher precedence than +. E.g. 10∗1 + 11∗1 = (1(0∗)1) + (1(1∗)1). Consider the regular expression r: (01 + 11)∗10 (1∗ + 0∗) 1.1) Which of the following words (ε is the empty word) belong to the language defined    by r?     Options:  ε, 101, 001101, 111011, 111010 1.2) For each of your answers in Question 1.1, give a brief explanation. For example, you can explain    how the regular expression will accept (i.e. match) the words that belong to its language, and    how it will not accept those that do not belong in it. 1.3) Give, as a transition graph, an FSA (possibly with ε-transitions) recognising the same language as r.Note: You should not use transitions with composite labels, e.g. of the form q1 →42→ q2. Thanks for the help :)

show the steps used to asnwer this question what are the star values?

What regular expression is represented by the grammer?  S →  aS | A A → bA | B B → cB | C C → dC | λ

2. Consider the following hierarchical state machine: input: a: pure output: b: pure a/b a/b D a/b -1- HB a/b a/ F Construct an equivalent flat FSM giving the semantics of the hierarchy. Describe in words the input/output behavior of this machine. Is there a simpler machine that exhibits the same behavior?

Draw a wait for graph to detect deadlock in given situation.

Suppose we have two industrial control systems S1 and S2 that are workingconcurrently. We need to forbid some sequence of actions from taking placebetween the two systems. One such action is allowing S1 and S2 to be onat the same time. Consider the alphabet:Σ = {On(S1), On(S2), Off(S1), Off(S2)}A sequence of actions is a word over Σ∗.i. Convert the property on sequences given above into a language, andthen define an NFA that accepts it.ii. A second property is that S2 must power off after S1, but S2 mustpower on before S1. Define a language which captures this property(and this property only), and then define a NFA that accepts it.

In a perceptron network there are two inputs and two synaptic weights. (CLO 2.1)Classify the perceptron is Class 1 or Class 2 using decision boundary.Input Weights BiasX1 -2 W1 1.5 B 1X2 -2.7 W2 1.8Find the given inputs (-3, 7) lies above line or below line in the quadratic equation 4x +2y - 15.

This is not a writing assignment but keeps getting rejected for one. Please help me draw this nondeterminisic finite automata. 1. Draw the NFA for the following regular expressions (a) (01)∗111, Σ = {0, 1} (b) (111)∪(01)∗ , Σ={0,1}