this problem is about pushdown automata:
Answer:
a.
on reading epsilon(nothing) , without looking at top of the stack and without modifying the stack.
b.
on reading a , without looking at the top of the stack and without modifying the stack contents.
c.
on reading a , and top of the stack symbol is 'A' then push 'B' on to the stack.
d.
on reading a , wihtout looking at the top of the stack push 'B' onto the stack.
e.
on reading a and the top of the stack is 'A' then POP the top of the stack i.e, A.
this problem is about pushdown automata: 4. (10 points) Explain in English what each of the...
what is the minimal corresponding maching (Finite Automata, Pushdown Automata, or Turing Machine) for each of the following languages? State which method is being used P3) What is the minimal corresponding machine (FA, PDA or TM) for each of the following languages? (You must provide proper explanations or proofs for your answer.) (30 points) o) L1 (every strings consist with a and b 0, 00,000), 0). (b) L2 balanced parenthesises , For example L2- (a) Ls ab" al n 20)...
and please list the actual member states for each class PROBLEM 1 (30 points) Given the following matrix of transition probabilities (see the labels of the states above and in front of the matrix): 0 (0 0 0 1 P-10 1/2 1/4 1/4 3 1 0 0 0 (a) (6 points) Classify the classes of the Markov chain number of classes: transient class(es): recurrent class(es) of which the absorbing state(s) is (are): (b) (8 points) Determine f1o PROBLEM 1 (30...
Problem 7.4 (10 points) A Markov chain Xo, X1, X2,.. with state space S = {1,2,3,4} has the following transition graph 0.5 0.5 0.5 0.5 0.5 0.5 2 0.5 0.5 (a) Provide the transition matrix for the Markov chain (b) Determine all recurrent and all transient states (c) Determine all communication classes. Is the Markov chain irreducible? (d) Find the stationary distribution (e) Can you say something about the limiting distribution of this Markov chain? Problem 7.4 (10 points) A...
part e) f) g) thanks Given the following matrix of transition probabilities (see the labels of the PROBLEM 2 (40 points) states above and in front of the matrix): 0 1 2 3 0(.6 4 0 0 1 0 0 3 .7 P 2 5 0 5 0 3 0 0 0 1/ Classify the classes of the Markov chain. (a) (7 points) number of classes: transient class(es)t: recurrent class(es)t of which the absorbing states are Find fo3 (b) (5...
and please list the actual member states for each class Given the following matrix of transition probabilities (see the labels of the PROBLEM 2 (40 points) states above and in front of the matrix): 0 1 2 3 0(.6 4 0 0 1 0 0 3 .7 P 2 5 0 5 0 3 0 0 0 1/ Classify the classes of the Markov chain. (a) (7 points) number of classes: transient class(es)t: recurrent class(es)t of which the absorbing states...
Problem 4 Economic Inequality (20 points) 1) Figure 2 below is an image of a Lorenz curve. a. (4) When the Lorenz curve sags lower, does that mean the economy is more equal or more unequal? b. (6) Explain how to use the information in Figure 2 to calculate the Gini coefficient i. What is the typical range for Gini coefficients? ii. What does a high number indicate? 100 Perfect Equality Line Percentage of income Lorenz Curve 100 Percentage of...
For context the class is about Automata, Computability, and Formal Languages I just need parts b & e done 14. Find grammars for E = {a, b} that gener- ate the sets of (a) all strings with exactly two a's. (b) all strings with at least two a’s. (c) all strings with no more than three a's. (d) all strings with at least three a’s. (e) all strings that start with a and end with b. (f) all strings with...
Automata: solve a - e 2. (10+10+10+10+10-50 points) Agrammar is a 4-tuple G, G-ON,E,11,L$) where N is a finite set of nonterminal symbols Σ is a finite set of terminal symbols is a finite set of rules S is the starting symbol Let N- (S, T s-{a, b, c} s-> ab aT >aaTb aT-ac S is the starting symbol. (a 10 points) Prove that the given grammar G is a context sensitive grammar. (b-10 points) What is the language L-...
20 points] Q1. The Stately State Transition Matrix, Ф 16 2 3 13 Consider a state transition matrix, Ф, for a SISO LTI system A1. A- 5 11 10 8 9 76 12 Please determine and justify: (a) Ф(t) for this system A 4 14 15 1 ] (b) Ф(s) for this system A (c) System A's characteristic polynomial (d) Ф(z) for this system A via Tustin's method (ie, trapazoid-rule) (e) A difference equation assuming: (1) a step input at...
UWDHURY GROUP A: Essay Part :(Answer any four) Each is worth 10 points 1. What is the fundamental economic problem of every society. If you were address this fundamental problem? Explain your answer with reference to cap every society?. If you were an economist how woul mi Explain your answer with reference to capitalist economy. 2. What is perfect competition? What are its characteristics? 3. What is total utility Des at is total utility? Describe the relationship between total utility...