Question 11 mah.Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line Give a description/pseudocode of a TM Mo that recognizes language D = {w over {0, 1}* | w is nota palindrome). For example: 1101 E D, 111100 € D, but 001100 # D. You can use traditional or any variationof TM we have covered in class.

INTRODUCTION: A mathematical model of computing known as the Turing machine describes an imaginary…

Give a description/pseudocode of a TM Mo that recognizes language D = {w over {0, 1}* | w is not a palindrome). For example: 1101 € D, 111100 € D, but 001100 € D. You can use traditional or any variation of TM we have covered in class.

Give a description/pseudocode of a TM Mo that recognizes language D = {w over {0, 1}* | w is not a palindrome). For example: 1101 € D, 111100 € D, but 001100 € D. You can use traditional or any variation of TM we have covered in class.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

Java considers the String data type as non-primitive, because it contains a sequence of characters and hence there is a predefined class called String dedicated to String processing. The String class has a lot of functions and continues to grow. See https://www.tutorialspoint.com/java/java_strings.htm for more on strings. Your task is to then create a java program that when give a sentence will replace the first occurrence of NUST with Namibia University of Science and Technology. Sample run 1: Enter a sentence: Welcome to my NUST. Output: Welcome to my Namibia University of Science and Technology. Sample run 2: Enter a sentence: The nust is a great institution of high learning. Output: The Namibia University of Science and Technology is a great institution of high learning.
IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
In this work, we ask you to design a deterministic Finite Automaton (FA) to recognise arithmetic expressions. When we say arithmetic expression, we mean a kind of expression you can type in a very basic desk calculator. That is, neither variables nor brackets are allowed. It contains only numbers and four arithmetic operators, +, -, *, and /. The following are some examples of arithmetic expression: 1. Any number string with or without signs - e.g. 3, -1, +10, 3.14, -0.70 and 099. 2. Number strings mixed with arithmetic operators e.g. 3+5, -1+2*3, 7/10-0.7, and -1.4-+8.2. An example of FA diagram for recognising a non- negative integer is given below. You may use it as a start point. You need to add a few more states and transitions to handle numbers with decimal point and signs (e.g. -5, +2, 0.21, -32.6, +99.05, but not the form 1.0E-3). Most importantly, you also need to add a few more things to deal with the arithmetic operators +, -, *, /. →start 0-9 digit 0-9
Give a description of a TM M, that recognizes language D = {w over {0, 1}*| w contains twice as many 0's as l's}. For example: 010 E D, 000011 E 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…
Build a TM over the alphabet E={a, b} that accepts the language DoubleA where each word hastwice as many a’s as b’s. You might find it easier if you use the Insert# routine.
Q# In Java, if you see a class name followed by “<T>”, as in List<T>, what does this mean?Group of answer choices 1.It is what is called a lambda-function. 2.It’s for making collections of objects of many types at the same time. For example, if I make List<T> myList = new List<T> I can put a String as one item, an int as another, and a Random as a third item. 3.You must specify an object type in place of the T; eg. List<Shape> will make a list of Shape objects. 4. It means that the object is of type Time.
2. Java considers the String data type as non-primitive, because it contains a sequence of charactersand hence there is a predefined class called String dedicated to String processing. The String classhas a lot of functions and continues to grow. Seehttps://www.tutorialspoint.com/java/java_strings.htm for more on strings. Your task is to then createa java program that when give a sentence will replace the first occurrence of NUST with NamibiaUniversity of Science and Technology.Sample run 1:Enter a sentence: Welcome to my NUST.Output: Welcome to my Namibia University of Science and Technology.Sample run 2:Enter a sentence: The nust is a great institution of high learning.Output: The Namibia University of Science and Technology is a great institution of high learning NB: IN JAVA PROGRAMMING
implement a c# program that tests our implementation of the CSet class by creating two sets, performing a union of the two sets, an intersection of the two sets, finding the subset of the two sets, and the difference of the two sets.
Please implement a complex class which can process complex numbers. It should have two member variables double real and double imaginary, and some methods, so that we can use it in the main function like the following: int main() { Complex a(3, 5); Complex b(1, 4); Complex c a + b; // (3+5i) + (1+4i) ( 4+9i) b; // (3+5i) (1+4i) (2+i) = a // (3+5i) * (1+4i) = (-17+17i) * b; a = a / b; // (3+5i) / (1+4i) (1.35-0.41i) %3D }
Write a code in C# that finds the smallest ID of a subject taught by the most teachers without using any Linq Lib's elements, such as OrderBy, OrderByDescending, etc: We know about the teachers at a school, what lessons they have and when. We identify the teachers, the subjects, the days of the week and the time slots in a day with ID numbers. Write a program that determines the subject that is taught by the most teachers.InputThe first line of the standard input contains the count of lessons (1≤L≤800), the count of teachers (1≤N≤100), the count of subjects (1≤M≤100), the ID of a teacher (1≤T≤N) and the ID of a day (1≤D≤5), separated by spaces. The next L lines contain 4 integers separated by spaces: the ID of the teacher (1≤TID≤N), the ID of subject taught (1≤TS≤M), day (1≤Day≤5), and time slot (0≤Time≤8) of a lesson. For example, 3 7 2 1 means that the third teacher teaches the seventh subject on the second day of the week in the first time slot.OutputThe first line of the standard…
Given the alphabet ∑={a, t, z} Describe the language L over the alphabet. i.e. {y,t,z,tt,tz...}: 1. ʎ U (t + z) U (t + z)22. a*tz*t3. (a+z) U(t + z)24. t(a+z)*5. ∑2
Language is C++ Rare Collection. We can make arrays of custom objects just like we’ve done with ints and strings. While it’s possible to make both 1D and 2D arrays of objects (and more), for this assignment we’ll start you out with just one dimensional arrays: directions as follows in the pictures