Question

Consider a language Lodd defined as follows:

• a € Lodd for a € {1,3,5,7,9} • ax e Lodd for a € {0,2,4,6,8} and x € Lodd • axb e Lodd for a, b e{1,3,5,7,9} and x € Lodd (

0 0
Add a comment Improve this question Transcribed image text
Answer #1

met, az 3 , =, 16 =4, Now, anbe Lodd for at be {4, 3, 5, 7,93 . But here to =4& {4, 3, 5,7,g} 1 374 is not in Lodd☺ a het ne Lodd where z z minerriinka , Here nona...ne are 3ince, ne lrodd Olen mina. nk E Lodd digits of an . amsen 7 ni E LCase-2? If kip odd then proceeding as previous way we get at (43) the step 1 es & Le44 twhich implies, - MK - Math Mera e Lod

Add a comment
Know the answer?
Add Answer to:
Consider a language Lodd defined as follows: • a € Lodd for a € {1,3,5,7,9} •...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • String digit sums. Consider strings over the alphabet 2= {0,1,2,3,4,5,6,7,8,9). We will recursively define the digsum...

    String digit sums. Consider strings over the alphabet 2= {0,1,2,3,4,5,6,7,8,9). We will recursively define the digsum function as follows: • digsum(€)=0 • digsum(ax)=a + digsum(x), where a e is interpreted as the numeric value of the digit. Just can't even. Consider a language Lodd defined as follows: • a € Lodd for a € {1,3,5,7,9} • ax e Lodd for a € {0,2,4,6,8) and x € Lodd • axb e Lodd for a, b € {1,3,5,7,9) and x € Lodd...

  • Suppose the language L ? {a, b}? is defined recursively as follows: ? L;    for every...

    Suppose the language L ? {a, b}? is defined recursively as follows: ? L;    for every x ? L, both ax and axb are elements of L. Show that L = L0 , where L0 = {aibj | i ? j }. To show that L ? L 0 you can use structural induction, based on the recursive definition of L. In the other direction, use strong induction on the length of a string in L0. 1.60. Suppose the language...

  • In the Pascal programming language, the If-Statement is defined as follows: Consider the following statement, and...

    In the Pascal programming language, the If-Statement is defined as follows: Consider the following statement, and then answer the related questions: <If-Statement> ::= If <Condition> Then <Statement> [Else<Statement>] <Statement> ::= <If-Statement> | <While-Statement> | <For-Statement> | <Assignment-Statement> <Condition> ::= [not] <Condition> | [not] <BooleanVariable> | <Variable> <Operator> Variable> | <Variable> <Operator> <Expression> | < Expression > <Operator> <Variable> | < Expression > <Operator> < Expression> | < Expression > <Operator> < Literal > | <Variable> <Operator> < Literal > <Operator>...

  • et l(a) be the language generated by g(a) - (n, 2, s, p) where 2 -...

    et l(a) be the language generated by g(a) - (n, 2, s, p) where 2 - [a, b), n= {s,x) and s->axb ... Question: Let L(a) be the language generated by G(a) - (N, 2, S, P) where 2 - [a, b), N= {S,X) and S->aX... Let L(a) be the language generated by G(a) - (N, 2, S, P) where 2 - [a, b), N= {S,X) and S->aXb X->aX|bX|epsilon (i) (3 marks) Describe the language L(a). (First generate a few...

  • Let S be the set of binary strings defined recursively as follows: Basis step: 0ES Recursive step...

    discrete math. Structural Induction: Please write and explain clearly. Thank you. Let S be the set of binary strings defined recursively as follows: Basis step: 0ES Recursive step: If r ES then 1rl E S and 0x0ES (I#x and y are binary strings then ry is the concatenation of and y. For instance, if 011 and y 101, then ry 011101.) (a) List the elements of S produced by te first 2 applications of the recursive definition. Find So, Si...

  • 2. (7 pt) Recall that the variance of a random variable X is defined by Var(X)...

    2. (7 pt) Recall that the variance of a random variable X is defined by Var(X) - E(X - EX)2. Select all statements that are correct for general random variables X,Y. Throughout, a, b are constants. ( Var(X) E(X2) (EX)2 ( ) Var(aX + b) = a2 Var(X) + b2 Var(aXb)a Var(X)+b ( ) Var(X + Y) = Var(X) + Var(Y) ) Var(x) 2 o ) Var(a)0 ( ) var(x") (Var(X))"

  • A + b a-b The quantity X is defined as follows: X where a and b are measured quantities. In our c...

    a + b a-b The quantity X is defined as follows: X where a and b are measured quantities. In our case, a 9, b 10, and both quantities are measured by a relative error of h-0.1%. Calculate the relative error of X by the probabilistic summation of the error components! Select one AX O A. 1.41% ○ B.AY=: 0.141% О с.--0.2% AX a + b a-b The quantity X is defined as follows: X where a and b are...

  • Digital signal processing question: 1. Consider the STDTFT defined as jwk where n] is the speech...

    Digital signal processing question: 1. Consider the STDTFT defined as jwk where n] is the speech signal and wIn] is the window sequence. Prove the following properties a. Linearity -if n]-ax[n]+by[n], then V(o,n)-aX(o,n)+bY(o,n b. Shifting-ifYn]=x(n-n] , then V(a,n)-X(a,n-nen, c. Modulation _ ifv[n] =x(n em," , then l'(?,n)=X(?-o,,n). d. Show that can be put in the form ie. X(a,n) is a smoothed spectral estimate of X(?) at frequency ?,

  • Let Σ = { a, b } , and consider the language L = { a...

    Let Σ = { a, b } , and consider the language L = { a n : n is even } ∪ { b n : n is odd } . Draw a graph representing a DFA (not NFA) that accepts this language.

  • 8. Let D be the set whose members are defined as follows. Basis Step: the number...

    8. Let D be the set whose members are defined as follows. Basis Step: the number 3ED Recursive Step: if x E D and y e D, then x + y e D. Prove that D={3n:n e +}.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT