Question 7: Turing Machines (a) Draw the state diagram of a Turing Machine, that converts every 'a' to 'b', and every 'b' to 'a', except for the last alphabet. Also, it goes to the accept state if the last alphabet is 'a', and goes to the reject state if the last alphabet is 'b'. Hint: Convert everything until you reach the end (blank symbol), then take one step backward and convert the last alphabet again. As you converted the last alphabet twice, it ensures that the last alphabet was not changed. Then stop and depending on what the last alphabet is, now finally, go to the accept or reject state.

Question 7: Turing Machines (a) Draw the state diagram of a Turing Machine, that converts every 'a' to 'b', and every 'b' to 'a', except for the last alphabet. Also, it goes to the accept state if the last alphabet is 'a', and goes to the reject state if the last alphabet is 'b'. Hint: Convert everything until you reach the end (blank symbol), then take one step backward and convert the last alphabet again. As you converted the last alphabet twice, it ensures that the last alphabet was not changed. Then stop and depending on what the last alphabet is, now finally, go to the accept or reject state.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter5: Looping

Section: Chapter Questions

Problem 3GZ

See similar textbooks

Similar questions

Can you help me with this code because this is a little difficult for me:question that i need help with:The Lights Out puzzle consists of an m x n grid of lights, each of which has two states: on and off. The goal of the puzzle is to turn all the lights off, with the caveat that whenever a light is toggled, its neighbors above, below, to the left, and to the right will be toggled as well. If a light along the edge of the board is toggled, then fewer than four other lights will be affected, as the missing neighbors will beignored. In this section, you will investigate the behavior of Lights Out puzzles of various sizes by implementing a LightsOutPuzzle class task: A natural representation for this puzzle is a two-dimensional list of Boolean values, where True corresponds to the on state and False corresponds to the off state. In the LightsOutPuzzle class, write an initialization method __init__(self, board) that stores an input board of this form for future use. Also write a method…
subject theory of computer science Given the language, L = {abb, aabb, babb, aaabb, ababb, …………..}, which of the following is the correct the regular expression that can represent L. A.(a+b)*ab B.(aa)*(bb)*b C.(a*ba*) D.(a+b)*abb
A hungry mouse wants to eat all four fruits in a maze such as the one below, in as few moves as possible.. At each turn the mouse can move any number of squares in one of the directions up, down, left or right, but it is not allowed to enter (or jump over) any walls (i.e., the black squares). Thus, the mouse moves just like a rook in chess. To eat a fruit, the mouse has to stop at that square. Assume that the maze has 4 fruits, and the size of b xh squares. 1. Give a suitable representatión of the states in this searching problem. 2. How many possible actions can the mouse perform at each move? (1.e., what is the branching factor?)
Artificial Intelligence (Part - 2) ==================== The Towers of Hanoi is a famous problem for studying recursion incomputer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (2) What is the size of the state space?
The Infinite Monkey Theorem states that a monkey hitting keys completely at random on a typewriter for an infinite amount of time will, eventually, type any given text. Even the complete works of William Shakespeare. Some quotes are truly amazing. Consider the famous quote, "BREVITY IS THE SOUL OF WIT" That's 26 amazing characters. Suppose a monkey is seated in front of a KEYBOARD WITH 28 CHARACTERS (one for each of the 26 letters in the alphabet, plus the space bar, and a comma). Suppose the monkey types only 26 characters completely at random. If X is the number of different 26 character strings it could have typed, then the chances that it typed the quote is one divided by X. What is X?
Can you help me with this code because I am struggling. The Lights Out puzzle consists of an m x n grid of lights, each of which has two states: on and off. The goal of the puzzle is to turn all the lights off, with the caveat that whenever a light is toggled, its neighbors above, below, to the left, and to the right will be toggled as well. If a light along the edge of the board is toggled, then fewer than four other lights will be affected, as the missing neighbors will beignored. In this section, you will investigate the behavior of Lights Out puzzles of various sizes by implementing a LightsOutPuzzle class. Once you have completed the problems in this section, you can test your code in an interactive setting using the provided GUI. See the end of the section for more details. Task: A natural representation for this puzzle is a two-dimensional list of Boolean values, where True corresponds to the on state and False corresponds to the off state. In the LightsOutPuzzle class, write an…
Conway's Game of Life: This is a zero person game with the following rules: (see Wikipedia for example) Any live cell with fewer than two live neighbours dies, as if by underpopulation. Any live cell with two or three live neighbours lives on to the next generation. Any live cell with more than three live neighbours dies, as if by overpopulation. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. Remember the oscillator or blinker of 3 cells. You can also find this blinker on Wikipedia. 1 21 1 2 1 21 3. 4 6 4. 6. 4 8. 9 8 9 #1 #2. #3 5. Consider now these 3 creatures at stage 1: Show how they look like in the next two stages: stage 2 and stage 3. Explain how you get the answers Creature 1 Creature 2 Creature 3 (here creature 1 is the blinker of 3 cells, horizontally; creature 2 consists of two adjacent cells, creature 3 consists of 4 adjacent cells horiztonally) ww (d) Creature 1 (10%), (e) Creature 2 (8%), (f) Creature 3 (20%)
Using a repetition construct, display the following on the screen (warm-up problem). L P P L
A tile of a monkey puzzle has four monkey halves that can be labelled as north(N), east (E), south (S), and west (W) half. In addition to the shape of the borderrectangle, these halves determine which edges can be placed next one other. There isalso another way to define how the tiles can be placed: Each tile corner (i.e. compassdirections NE, SE, SW, and NW) has a monkey quarter. If we abstract this quarter, forexample, with a letter, only the tiles with the same letter in their touching corners canbe adjacent. illustrates one valid solution for this quarter monkey puzzle.Are the two monkey puzzle representations equivalent in the sense that if we have apile of ‘half monkey’ tiles H, it is possible to define a pile of ‘quarter monkey’ tilesQ that gives exactly the same set of solutions for the puzzle (and vice versa)?
8. Convert the automaton of question 6 to DFA by showing all the steps. 6. Compute ϵ-closure for each state for the following transition table: Solve Question 8 Only
AI a modern approach 10.3 The monkey-and-bananas problem is faced by a monkey in a laboratory with some bananas hanging out of reach from the ceiling. A box is available that will enable the monkey to reach the bananas if he climbs on it. Initially, the monkey is at A, the bananas at B, and the box at C. The monkey and box have height Low, but if the monkey climbs onto the box he will have height High, the same as the bananas. The actions available to the monkey include Go from one place to another, Push an object from one place to another, ClimbUp onto or ClimbDown from an object, and Grasp or Ungrasp an object. The result of a Grasp is that the monkey holds the object if the monkey and object are in the same place at the same height. a. Write down the initial state description.b. Write the six action schemas.c. Suppose the monkey wants to fool the scientists, who are off to tea, by grabbing the bananas, but leaving the box in its original place. Write this as a general goal (i.e.,…
The landline telephone numbers in a country typically consists of an area code (prefix) followed by the subscriber number. Meaning, a telephone number typically has a . To call a subscriber we just need to call the number with the relevant prefix followed by the subscriber number. The 'United Planets' is a federation of planets that has a Telephone Company called 'Astronomy Telecom' which uses the following classification or scheme for telephone numbers similar to our landline telephone numbers in a country. Stars: Starts with 511 followed by subscriber number (consider there are infinite stars where each star is considered as a subscriber). Comet: Starts with 522 followed by subscriber number (consider there are infinite comets where each comet is considered as a subscriber). Asteroid: Starts with 533 followed by subscriber number (consider there are infinite asteroids where each asteroid is considered as a subscriber). Planets: Starts with 12, followed by at least 6 digits and none…