Give a description of a TM M, that recognizes language D = {w over {0, 1}*| w contains twice as many O's as 1's}. For example: 010 € D, 000011 € D, and 0110 € D. In this case, you are free to use in your description traditional or any variation of TM we have covered in class. In addressing be sure to pay special attention to final (halting) configurations, when required. you are expected to provide pseudocode for the corresponding machines. Remember that in your pseudocode, you need to be clear of what are your reading and writing on the tape (and which tape if you use more than 1), the direction in which the tape heads will move, and when the Turing Machine should halt and accept and/or halt and reject. Having said that, the point is not for you to describe state-by-state what the Turing Machine would look like. Instead, the goal of the description is for you to offer a high level overview that considers what to read/write in which order, in which directions the tape would move and how you reach accept/reject decision.

Give a description of a TM M, that recognizes language D = {w over {0, 1}*| w contains twice as many O's as 1's}. For example: 010 € D, 000011 € D, and 0110 € D. In this case, you are free to use in your description traditional or any variation of TM we have covered in class. In addressing be sure to pay special attention to final (halting) configurations, when required. you are expected to provide pseudocode for the corresponding machines. Remember that in your pseudocode, you need to be clear of what are your reading and writing on the tape (and which tape if you use more than 1), the direction in which the tape heads will move, and when the Turing Machine should halt and accept and/or halt and reject. Having said that, the point is not for you to describe state-by-state what the Turing Machine would look like. Instead, the goal of the description is for you to offer a high level overview that considers what to read/write in which order, in which directions the tape would move and how you reach accept/reject decision.

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

pls give mommens by expression and statements , thanks Recall that in C++, there is no check on an array index out of bounds. However, during program execution, and array index out of bounds can cause serious problems. Also, in C++, the array index starts at zero. Design and implement the class myArray that solves the array index out of bounds problem, and also allows the user to begin the array index starting at any integer, positive or negative. Every object of type myArray is an array of type int. During execution, when accessing an array component, if the index is out of bounds, the program must terminate with an appropriate error message. Consider the following statements: myArray<int> list(5); //Line 1 myArray<int> myList(2, 13); //Line 2 myArray<int> yourList(-5, 9); //Line 3 This statement in line one declares list to be an array of five components, the component type is int, and components are: list[0], list[1],…, list[4];…
Consider the Person class in Problem 1. Implement the interface PersonPriorityQueueInterface provided in the assignment. In your implementation, you must use an instance of AList (which you used in Problem 1) to store the list of persons. We consider that a person whose age is higher than a second person also has a higher priority. Thus, the method peek(), for example, should return the person who is the oldest in the list. Your implementation should be O(n) for add, and O(1) for the remaining methods. Consider the Person class in Problem 1. Implement the interface PersonPriorityQueueInterface provided in the assignment. In your implementation, you must use an instance of AList (which you used in Problem 1) to store the list of persons. We consider that a person whose age is higher than a second person also has a higher priority. Thus, the method peek(), for example, should return the person who is the oldest in the list. Your implementation should be O(n) for add, and O(1)…
Please help. How to solve this on Java language by using only Dynamic Programming? Thank you. We are given a set A of integers. Check whether we can partition A into three subsets with equal sums. It is important to note that all elements should be included in the equally divided subsets; no element should be left out, and none of the elements should be repeated in the subsets.For example: A={4,7,6,2,10,7,10,2} has such a partition: {4,2,10}, {7,7,2},{6,10}Input: A set, A, of integersOutput: if we can partition A into three subsets with equal sums, print subsets otherwise present a suitable message.
Suppose P(x,y) is some binary predicate defined on a very narrow domain ofdiscourse: just the integers 1, 2, 3, and 4. Based on the following table, P(x,y) is trueor false for each of the 16 pairs of these numbers (x values are rows, y values arecolumns).1 2 3 41 T F F F2 F T T F3 T T T T4 F F F FFor example, P(1, 3) is false, as indicated by the F in the first row, third column.Use the table to decide whether the following statements are true or false.a. ∀x∃Yp(x, y).b. ∀y∃xP(x, y).c. ∃x∀yP(x, y).d. ∃y∀xP(x, y).
Create a hierarchy of objects (like Cord and FusedCord) in C++. Use const methods for getters, const references to arguments for setters, and demonstrate the correct allocation and deallocation using shared pointers in your tests.
An “inverted file” is a critical data structure for implementing applications like the index of a book, or a web search engine. Given a document D (which can be viewed as an unordered, numbered list of words), an inverted file is an ordered list of words L such that for each word W in L, we store the indices of the places in D where W appears. Write a C# program (from scratch please, written by yourself (ask instructor if you are stuck), not borrowed from any other sources) that reads in a list of words separated by spaces from a text file, then uses an efficient O(N) algorithm to create the inverted file index (hint: consider the topic of this chapter, consider using a Dictionary/hashtable to help you), and writes this index out to another file or prints it to the screen. Each line of the output file should start with the next word (the words should be listed in alphabetical order, and this sorting does not have to be part of the O(N) runtime complexity, e.g. you can use regular…
Python. Please, help me to write such a program in Python! Sequences of integers a1,…, an, b1,…, bm, integer k are given. If the sequence a1,…, an does not contain a single member with the value k, then the first in order member of this sequence, if it is not less than all other members, is replaced by the value k. According to the same rule, transform the sequence b1, ..., bm in relation to the value k = 10.
solve the problem in java:Consider the are n=2 subjects and needed =[4,5]answered questions, to pass.The student has answered =[2,4] questions in the two subjects so far, and can answer another q=1 questions across all subjects combined. The best outcome is to answer an additional question in the second subject on order to pass it, as 2 more answers required to pass the first subject. the max number of subject s that can be passed is 1. the function must return an integer that can represent the max number of subjects that can be passed. public static int maxNumsub(List <Integer> answered, List<Integer> needed, int q){//write code here}
Develop a java program to define an Symbol table class so that each symbol is associated with a numeric value. The two main methods are set() and get(): void set(String sym, int value); int get(String sym); The set() method associates the int value with the symbol sym, while the get() method performs the complement of retrieving the int value previously associated Define appropriate exceptions so that clients of the Symbol table may respond to conditions appropriately. For example, when they retrieve the value of a nonexist clients can either stop execution and display an error message or use a default value of 0 Symbol Numeric Value
I am learning C for a class I am taking and a homework assignment asks us to makes a list of integers, divides the list into a number of segments, and displays each segment in reverse order. We need to use the function malloc to dynamically allocate locations for variables a and b. The full assignment is below. I am not too familiar with C and I don't know how to split the list into two arrays.
Please write a full C++ code and provide code and output Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class linkedStackTypethat returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator.
Write a C# program that includes two methods that are called a largenumber of times. Both methods are passed a large array, one by valueand one by reference. Compare the times required to call these twomethods and explain the difference. Be sure to call them a sufficientnumber of times to illustrate a difference in the required time.