Using Python programming language. There are exactly N people living in a certain parallel universe. The Ith of these N people claim to be the parent of exactly Ai off these N people. However, some of these people may be lying - the person may either be telling the truth (in which case they have exactly Ai children) or lying down (in which case they can have any number of children). It is known that each person has at most one parent. Furthermore, as one would expect, a person's child is not allowed to also be their ancestor. What is the maximum possible number of truth tellers in this universe Possible input 1 2 10 Required Output 2

Using Python programming language. There are exactly N people living in a certain parallel universe. The Ith of these N people claim to be the parent of exactly Ai off these N people. However, some of these people may be lying - the person may either be telling the truth (in which case they have exactly Ai children) or lying down (in which case they can have any number of children). It is known that each person has at most one parent. Furthermore, as one would expect, a person's child is not allowed to also be their ancestor. What is the maximum possible number of truth tellers in this universe Possible input 1 2 10 Required Output 2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Questions: Consider the following Turing Machine: A a b→ R D à, R → R 8.D àȧ → R a → R b B → R Accept b→ b, L b→ L a → L b→ R Note that the symbol à(b) is a marked a (b). 1. What is the sequence of configuration states starting at configurations given in the table on the reverse side of this? Which of these strings are recognized? (You can fill out each column and then photo/scan it to include with the rest of your solutions or recreate this electronically.) 2. What state is missing from the state diagram? Explain the convention for entering this state with an example configuration in the state B whose next configuration enters this state. What about the state diagram let you know that the next state was this missing state? 3. What do the self-loops on state B accomplish? What purpose this serve in the context of this Turing machine deciding to accept or reject a string? 4. What do the self-loops on state Caccomplish? What purpose this serve in the context of this Turing machine…
Let x, y, z be positive integers (x, y, z> 0) represented in unary. Assume that x > z. Design a Turing Machine (TM) that computes the function f (x, y, z) = x+y=z. More specifically, go w (x) Ow (y) Ow (z) +* qƒw (x+y=z) 0 Draw the transition graph of the TM. Make sure you clearly indicate the initial and final states. Do not draw the block diagram! Here is an example of a computation performed by the TM: if x = 5, y = 2, z = 4 then qo1111101101111 -* qƒ1110
Create a Turing machine that when started anywhere on the tape will halt if and only if there is a 0 somewhere on the tape., since it only lets you enter a single input string as the starting configuration of the tape. （For this problem, the tape can start with 0s and 1s scattered anywhere on the tape - they do not have to be contiguous. Any permutation of 0s, 1s and blanks is a possible starting configuration.）
Question 3 In the homework we saw Turing machines for AND, OR, NOT. Here's the definition for XOR. qo O B q1 q1 BR q2 q0 1 B q3 q3 BR q4 q4 0 1 q5 94 1 0 q6 Trace the machine's execution on input 11 by showing the successive configurations. List one configuration per line with a single space separating each part of the configuration. Recall that the parts of the configuration are in the following order: current-state current-head tape-to-left tape-to- right. Use "e" for e and use it only in the "tape-to-left" or "tape-to-right" positions when there is nothing but blanks in those directions. Otherwise list all characters explicitly (and use B for a blank character when needed). initially q0 1 e 1 Step 1 Step 2 Step 3
Construct a Turing machine that accepts the language of strings of the form an, where nis a composite number. A composite number is any integer n that can be written as a product n = p ·q,where p and q are integers with 1 < p, q < n. Specifically for the purpose of this question, 0 and 1 are notconsidered composite numbers.Your machine can be non-deterministic, and it can use multiple tapes (as many as you need). I suggestbreaking up the construction into smaller sub-tasks. In particular, the machine you built in Question 3might be useful.For this question, it is enough to give a detailed description of the algorithm of your machine. You donot need to draw a full transition diagram. Although you can draw diagrams for smaller parts if it helpsyou illustrate your construction.
8. Give a Turing machine that computes the function f(w)= ww", where we {a,b}* and w is the reverse of w.
For a Turing machine M, (M) refers to the binary representation of M. For a Turing machine M, L(M) contains the set of all strings accepted by M. For a Turing machine M and an input x € {0,1}*, Steps(M, x) refers to the number of steps taken by M to execute on x before it halts. Here, one step of execution of M on x = one movement (left or right) of the tape head. For a Turing machine M and an input x = {0,1}*, we define the following: ReachCells(M,x) = {i : M reaches ith tape cell when M is executed on x} Informally, it contains all locations on the tape that are visited when M is ecuted on x. The leftmost location on the tape is the first tape cell, the location next to it is the second tape cell, and so on. A string w₁ is an anagram of w2 if w₁ can be obtained by rearranging the alphabets of w2. Formally, if w₁ is an n length string, wê is called an anagram of w₁ if there exists a permutation à on n elements such that π(w₁) = W2.
Use JFLAP to construct the Turing machine that recognize the language of {0n1n | n ≥ 1}. Test your constructed machine on at least 6 input strings. Note: When drawing a Turing machine in JFLAP, you can enter the blank tape symbol by simply leaving a field blank.
Example 9.7 For E = {a,b}, design a Turing machine that accepts L= {a,b„:n21}. Intuitively, we solve the problem in the following fashion. Starting at the leftmost a, we check it off by replacing it with some symbol, say x. We then let the read-write head travel right to find the leftmost b, which in turn is checked off by replacing it with another symbol, say y. After that, we go left again to the leftmost a, replace it with an x, then move to the leftmost band replace it with y, and so on. Traveling back and forth this way, we match each a with a corresponding b. If after some time no a's or b's remain, then the string must be in L. Working out the details, we arrive at a complete solution for which Q= {qo91;9293,94},F= {q4}, E= {a,b},T={a,b, x, y,¤}. The transitions can be broken into several parts. The set
Create a Turing Machine where the alphabet is { a b c } and L be the language of all words in which all the a's come before the b's and there are the same number of a's as b's and arbitrarily many c's that can be in front, behind, or among the a's and b's. These strings should be accepted ab abc acb cab cacbc caaccbcb caabcb ccacaabcccbccbc These strings should be rejected a b c ba bab abab abbab bbbbaab bbbbbbbbb aaaabbbbb aaabbbbaaabbbb Handwroitten weill work.
Design a Turing machine that accepts L. L = {ww | w ԑ (a, b)+} Draw the tape and write down the instantaneous descriptions.
consider a Turing machine implemented by the following state diagram, write the . transition table for this machine * BBR OxR 91 xix.R X 0:0,R vy,R 1\y,L 94 y\y,R xix.R 010.L ...YY.01. Screenshot yly, L 00,L