2. Consider the following multi-step implementation level description of a Turing machine with input alphabetΣ = {a,b,#}.Alice On input string w:1. Check the form of w is {a,b} #{a,b}+. Return the read head to the start (left end) of the string.2. Scroll right to the left-most unmarked symbol before the # sign.A. If there are no more unmarked symbols before the # sign, goto step 5B. Mark the left-most unmarked symbol remembering if it's an a or b.Dickinson3. Scroll right to the first unmarked symbol after the # sign.A. If there is no unmarked symbol after the # sign then Alice rejects w.B. If this symbol does not match the remembered symbol from step 2B then Alice rejects w.C. Mark the this symbol24. Scroll to the left most end of the tape and goto step 2.5. Check that all symbols after the # sign are marked. If any unmarked symbols are found, Alice rejects w,otherwise Alice accepts w.(a) What language does Alice recognize/decide?(b) Is Alice a decider or a recognizer? Explain (with more then Alice loops or doesn't loop).(c) Write a few sentences analyzing the time complexity of Alice. Is the language Alice decides/recognizes amember of P? Why or why not?

In this question we have to understand about Turing machine named Alice and its language…

2. Consider the following multi-step implementation level description of a Turing machine with input alphabet Σ= {a,b, #}. Alice On input string w: = 1. Check the form of w is {a,b}+#{a,b}+. Return the read head to the start (left end) of the string. 2. Scroll right to the left-most unmarked symbol before the # sign. A. If there are no more unmarked symbols before the # sign, goto step 5 B. Mark the left-most unmarked symbol remembering if it's an a or b.

2. Consider the following multi-step implementation level description of a Turing machine with input alphabet Σ= {a,b, #}. Alice On input string w: = 1. Check the form of w is {a,b}+#{a,b}+. Return the read head to the start (left end) of the string. 2. Scroll right to the left-most unmarked symbol before the # sign. A. If there are no more unmarked symbols before the # sign, goto step 5 B. Mark the left-most unmarked symbol remembering if it's an a or b.

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

Create a Turing Machine in JFLAP that decides the language. You may have "multiple final states" for readability (final states cannot have any outgoing transitions). You do not need to show the reject state.
Implement programme provides an example of how to carry out these tasks. The string "Hello world" is used to create a String object. The first word and the second word are then separated into the string's two parts.
Write a Java program that reads a sentence consisting of five words and determines the shortestword and longest word without using an IF statement or a loop.
Write a JAVA program that would match a string. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). The program finds the first (or all) instances of the pattern in the text and changes that word in all uppercase and displays its number of occurrences. Sample Input: Text string: You will always have my love, my love, for the love I love is as lovely as love itself. Pattern string: love Sample Output: New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself. Number of occurrence: 5
Create Programs to implement the below problems. The implementation language can be any language like Python, C++, Java. Design an automaton that rejects words consisting of the same consecutive numbers. That is, every successive number should be different over the alphabet [0-5]. For example, the word “0123” is accepted and the word “0112”, “33355” will be rejected because they contain the same consecutive letters. Design an automaton that rejects words consisting of the same consecutive numbers. That is, every successive number should be different over the alphabet [0-5]. For example, the word “0123” is accepted and the word “0112”, “33355” will be rejected because they contain the same consecutive letters.
Write a java program that would match a string. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). The program finds the first (or all) instances of the pattern in the text andchanges that word in all uppercase and displays its number of occurrences. Sample Input:Text string: You will always have my love, my love, for the love I love is as lovely as love itself. Pattern string: love Sample Output:New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself. Number of occurrence: 5
I need to write a java program to draw one of four recursively defined patterns.The patterns are in the attached picture. In each pattern a smaller square is drawn at each of the four corners of the next larger square. This pattern repeats again and again. It might repeat any number of times or levels. In the picture, the pattern is repeated four times or levels. If another level were asked for, then 192 very small squares would have to be drawn. The patterns differ in which squares are drawn on top of the others and thus may be hidden from view. The largest square, the one at level one, is drawn in the center of a square canvas and the length of its side is one half the length of the side of the canvas. The center of the next smaller square is always at the corner of the larger square. And the size of the next smaller square is determined by a fixed ratio R. If the smaller square has a side of length s and the next larger square has a side of length b, then R is the ratio b/s. In…
Write a Java program that takes a string as input and reverses the order of words in the string. For example, if the input is "Hello World", the output should be "World Hello". Explain your approach and the time and space complexity of your solution.
Write a program that takes a string and integer as input, and outputs a sentence using those items as below. The program repeats until the input string is quit 0. Ex: If the input is: apples 5 shoes 2 quit 0 the output is: Eating 5 apples a day keeps the doctor away. Eating 2 shoes a day keeps the doctor away. import java.util.Scanner; public class LabProgram {public static void main(String[] args) {Scanner scnr = new Scanner(System.in);String some_string;int some_int;some_string = scnr.next();some_int = scnr.nextInt();if (some_int != 0){System.out.println("Eating " + some_int + " " + some_string + " a day keeps the doctor away.");}}} My program wil online output the first input but not the next. What am I missing???
Design a program that reads a Java program and makes a list of all the user-defined identifiers. You will need a second list of all the Java reserved words. Whenever you encounter a token, search the list of reserved words. If the token is not a reserved word, you then should search the list of user-defined identifiers. If the token is not on either list, you should add it to the list of identifiers. Java
Write a program in java to check whether a string is a rotation of another. Take both string from user.
Write a program in java to take a string from. User and replace the first character by # . Assume that string has at least one character