Which claim is always true: L1 and L2 are regular languages, L =
L1 - L2,...
Which claim is always true: L1 and L2 are regular languages, L =
L1 - L2, then L
is finite
is regular
is complicated
is infinite
Consider two languages L1 and L2 accepted by the pushdown
automata M1 = (K1, Σ, Γ1,...
Consider two languages L1 and L2 accepted by the pushdown
automata M1 = (K1, Σ, Γ1, ∆1, s1, F1) and M2 = (K2, Σ, Γ2, ∆2, s2,
F2), respectively. Show how to construct the pushdown automaton M =
(K, Σ, Γ, ∆, s, F ) that accepts L1L2.
Find the point of intersection of the two lines l1:x⃗
=〈8,6,−16〉+t〈−1,−5,−1〉l1:x→=〈8,6,−16〉+t〈−1,−5,−1〉 and l2:x⃗
=〈21,1,−43〉+t〈3,1,−5〉l2:x→=〈21,1,−43〉+t〈3,1,−5〉
Intersection point:
Find the point of intersection of the two lines l1:x⃗
=〈8,6,−16〉+t〈−1,−5,−1〉l1:x→=〈8,6,−16〉+t〈−1,−5,−1〉 and l2:x⃗
=〈21,1,−43〉+t〈3,1,−5〉l2:x→=〈21,1,−43〉+t〈3,1,−5〉
Intersection point:
Are lines L1 and L2 perpendicular: L1 (-7,1) and (5,-2) L2 (3,7)
and (0,-5) a.) No,...
Are lines L1 and L2 perpendicular: L1 (-7,1) and (5,-2) L2 (3,7)
and (0,-5) a.) No, the lines are not perpendicular because the
product of their slope equals -1. B.) Yes , the lines are
perpendicular because the product of their slopes does not equal
-1. C.) No, the lines are not perpendicular because the product of
their slopes does not equal -1. D.) Yes, the lines are
perpendicular because the product of their slope equals -1.
Determine whether the lines
L1:→r(t)=〈−2,−1,3〉t+〈−5,−3,−1〉 and
L2:→p(s)=〈4,2,−6〉s+〈4,−1,0〉
intersect. If they do, find the point of intersection.
Determine whether the lines
L1:→r(t)=〈−2,−1,3〉t+〈−5,−3,−1〉 and
L2:→p(s)=〈4,2,−6〉s+〈4,−1,0〉
intersect. If they do, find the point of intersection.