Let A = { x , y } and let S be the set all strings over A . Define a relation C from S to S as follows: For all strings s and t in S, ( s , t ) ∈ C means that t = ys Then C is a function because every string in S consists entirely of x’s and y’s and adding an additional y on the left creates a single new string that consists of x’s and y’s and is, therefore, also in S . Find C ( x ) and C ( yyxyx ).
Let A = { x , y } and let S be the set all strings over A . Define a relation C from S to S as follows: For all strings s and t in S, ( s , t ) ∈ C means that t = ys Then C is a function because every string in S consists entirely of x’s and y’s and adding an additional y on the left creates a single new string that consists of x’s and y’s and is, therefore, also in S . Find C ( x ) and C ( yyxyx ).
Solution Summary: The author explains how the function C adds y to the left of the input string.
Let
A
=
{
x
,
y
}
and let S be the set all strings over A. Define a relation C from S to S as follows: For all strings s and t in S,
(
s
,
t
)
∈
C
means
that
t
=
ys
Then C is a function because every string in S consists entirely of x’s and y’s and adding an additional y on the left creates a single new string that consists of x’s and y’s and is, therefore, also in S. Find C(x) and C(yyxyx).
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.