Let M be the PDA defined by Q = {q, q0 , q1 , q2 }, Σ = {a,b}, Γ = {a}, F := {q , q1}. δ(q0 , a , Z0) = {(q, Z0 ) } δ(q , a, Z0) = {(q , aZ0)} δ(q , a, a) = {(q , aa)} δ(q , b , a) = {(q1 ,e)} δ(q1 , b , a) = {(q1 ,e)} δ(q1 , b, Z0 ) = {(q2 , e)} Describe the CFG and the language accepted by M

Let M be the PDA defined by Q = {q, q0 , q1 , q2 }, Σ = {a,b}, Γ = {a}, F := {q , q1}. δ(q0 , a , Z0) = {(q, Z0 ) } δ(q , a, Z0) = {(q , aZ0)} δ(q , a, a) = {(q , aa)} δ(q , b , a) = {(q1 ,e)} δ(q1 , b , a) = {(q1 ,e)} δ(q1 , b, Z0 ) = {(q2 , e)} Describe the CFG and the language accepted by M

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section: Chapter Questions

Problem 4PP

See similar textbooks

Similar questions

TM M = (Q, E, I, 6, 90, 9a, qr), where Q = {90, 91, 92, 9a, 9r}, Σ = {0, 1}, r = {0, 1, L}, and 8 is: 8(qo, U) = (qr, U, R) 8(90, 0) = 8(go, 1) (91, 0, R) (qo, 1, R) = 8(g1, L) = (ga, U, R) 8(91,0) = (91, 0, R) 8(91, 1) = (92, 1, R) = (92, U, R) 8(92, U) 8(92, 0) = (90, 0, R) 8(92, 1) = (92, 1, R) i. Prove that M is NOT a decider. ii. Mathematically describe the language A that M recognises. Prove that A ≤ L(M). iii. Prove A = L(M). iv. Is A Turing-decidable? [Give clear reasons for your answer. No need for a formal proof.]
Given g = {(1,c),(2,a),(3,d)}, a function from X = {1,2,3} to Y = {a,b,c,d}, and f = {(a,r),(b,p),(c,δ),(d,r)}, a function from Y to Z = {p, β, r, δ}, write f o g as a set of ordered pairs.
Convert the following NFA into a DFA. M=(Q, E, 8, 9o, F) Q={A, B, C, D} Σ= {a,b,c} 8(A, a) = {A, B} 8(B, a) = {B} 8(B, c) = {D} 8(C, a) = {A} 8(C,b) = {C} 8(D, c) = {B,C} 90 = A F = {C}
8. X. Let f: RR defined by f(x) = x³ -
Determine P(A x B) – (A x B) where A = {a} and B = {1, 2}.
If A = {1, 2, 6} and B = {2, 3, 5}, then the union of A and B is
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
Let x(t) = u(cos(2nt)) (u(t)- u(t-2)) and h(t)=etu(t), and let y(t) = x(t) *h(t). What is the value of y (2) ? Hint: u(x) is the unit step function
Let A = {c, n, b}, B = {x, y} and C = {0, 1}. Find A)A X B X C B)C X B X A C)B X C X C
Given A={1,2,3,4,5,6}, B={4,5,6,7,8,9}. Compute (c)A−B=
procedure Horner(c, a_(0), a_(1), a_(2),… , a_(n): real numbers)y := a_(n)for i := 1 to ny := y ∗ c + a_(n−i)return y {y = a_(n)c^(n) + a_(n−1)c^(n−1) + ⋯ + a_(1)c + a_(0)}a) Evaluate 3x^(2) + x + 1 at x = 2 by working througheach step of the algorithm showing the values assigned at each assignment step.b) Exactly how many multiplications and additions areused by this algorithm to evaluate a polynomial ofdegree n at x = c? (Do not count additions used toincrement the loop variable.)
The area of an arbitrary triangle can be computed using the formula area = √(s(s–a)(s–b)(s–c)) where the square root is applied to the entire product (Links to an external site.) and where a, b, and c are the lengths of the sides, and s is the semiperimeter of the triangle given (Links to an external site.) by the formula: s = (a + b + c)/2 EXTRA CREDIT: 10 points for adding a function named getInput that initializes the three side lengths from outside of main. Write a void function named (Links to an external site.) triangle that computes the area and perimeter (as well as the semiperimeter which will be used to compute the area) of a triangle based (Links to an external site.) on the length of the sides. The function should use five parameters (Links to an external site.)—three value (Links to an external site.) parameters (Links to an external site.) that provide the lengths of the edges and two reference parameters (Links to an external site.) that store (Links to an external…