![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 28.05.2021 14:00 OliviaParis8837
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.
![ansver](/tpl/images/cats/User.png)
Answers: 2
Another question on Computers and Technology
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 22.06.2019 04:30
There is a simple pattern for determining if a binary number is odd. what is it and why does this pattern occur? how many bits would you need if you wanted to have the ability to count up to 1000? how high could you count in binary if you used all 10 of your fingers as bits? (finger up means 1, finger down means 0)
Answers: 3
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 23.06.2019 23:30
Match the following errors with their definitions. a. #name b. #value c. #ref d. 1. when a formula produces output that is too lengthy to fit in the spreadsheet cell 2. when you enter an invalid cell reference in a formula 3. when you type text in cells that accept numeric data 4. when you type in a cell reference that doesn’t exist
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 09:30
What is the definition of digital literacy?
Answers: 1
![question](/tpl/images/cats/informatica.png)
You know the right answer?
For each of the following languages, give a recursive description of the language. Your basis step m...
Questions
![question](/tpl/images/cats/himiya.png)
![question](/tpl/images/cats/himiya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 23.02.2021 22:00
![question](/tpl/images/cats/User.png)
SAT, 23.02.2021 22:00
![question](/tpl/images/cats/istoriya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 23.02.2021 22:00
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/istoriya.png)
History, 23.02.2021 22:00
![question](/tpl/images/cats/istoriya.png)
History, 23.02.2021 22:00
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 23.02.2021 22:00
![question](/tpl/images/cats/en.png)
English, 23.02.2021 22:00
![question](/tpl/images/cats/mat.png)
Mathematics, 23.02.2021 22:00
![question](/tpl/images/cats/himiya.png)
Chemistry, 23.02.2021 22:00
![question](/tpl/images/cats/mat.png)
Mathematics, 23.02.2021 22:00
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/istoriya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 23.02.2021 22:00