For each of the following languages, give a recursive description of the language. Your basis step must explicitly enumerate a finite number of initial elements. Try to use the shortest description possible (in terms of the number of recursive rules and the number of basis rules). Briefly (1-2 sentences) justify that your description defines the same language but do not give us a full proof; (a) Binary strings that start with 0 and have odd length (i. e. an odd number of characters)
(b) Binary strings r such that len(x) = 1 (mod 3) where len() is the number of characters in r.
(c) Binary strings with an odd number of Os.

answer; the correct answer is technician b;

answer///quick access toolbar;

we can all learn from our past mistakes because we all have different ways of learning different types of techniques. my way may or may not another classmate remember and have the repetition to acknowledge such standard. such as remembering acronyms. using abbreviations to us remember keep things in order in our memory. this us figure out what comes next in the sequence. if so, what we have is a sentence of just letters all in caps. we either know the meaning or have no idea what it stands for. most of the time we know the meaning and context. but most of us who don't know, should learn by having a quick glance at what needs to be remembered. such as repetition in the memory for acronyms. one way that me, is the fact that i'm always doing math and english assignments. so we have to remember specific meanings such as soapstone for documents, such as citing correctly. or pemdas for doing the equations correctly, even if it's the super long way. this works for everyone. you just have to find what works for you by practicing and repetition daily.