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 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.
Implement a function in a programming language of your choice to check if a given string is a palindrome. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Write a java program that reads a sets of integers and then finds and print the sum of the even and odd integers
Write a Python program that reads a string as an input from the user where multiple numbers are separated by spaces. Then, make a list of numbers from the input string without using the split() function and print the list. Finally, remove all the occurences of **even numbers** from the same input list and print the modified list. ========================================================================= **Sample Input:** 7 12 4 55 96 2 11 61 33 42 **Sample Output:** [7, 55, 11, 61, 33] **Hint:** use string.split() to get a list: [7, 12, 4, 55, 96, 2, 11, 61, 33, 42]\Then work on this list.\You can use either a loop or list comprehension to get ther final list. #assign the output list to variable "list_out" def task3(str_in): # YOUR CODE HERE return list_out
4. A palindrome is a word that has the same spelling forwards and backwards, like "MADAM". Write a recursive Java method to check if a string is a palindrome.
Create Programs to implement the below problems. The implementation language can be any language like Python, C++, Java, etc. . Design an automaton that accepts the following language on the alphabet ∑ ={a,b} . (1) All strings with exactly one b. (2) . All strings with atleast two a. (3). All strings except those which end with aab. Use a menu to select the choice (1 or 2 or 3).
Write a program Java to convert an integer to a string containing its hex representation, then print the result. Hex, short for Hexadecimal, is the base 16 representation, using all the digits 0-9, and in addition the letters A (10), B (11), C (12), D (13), E (14), and F (15). So numbers less than 10 are written as usual, numbers 10-15 are written with the corresponding letter, 16 is written "10", 17 (which is 16+1) is written "11", 26 (16+10) is written "1A", 27 is "1B", 32 is "20", 33 is "21", and so on. Your program must include a recursive method public static String intToHex(int n) intToHex must return the hex representation of its given integer, and must have a recursive implementation similar to the intToString example in the lecture material. For example, intToHex(1) must return "1", intToHex(12) must return "C", intToHex(123) must return "7B", intToHex(1234) must return "4D2", intToHex(12345) must return "3039", intToHex(123456) must return "1E240", and of course…
Given a Java program p and the input 0, consider the problem, “Does p ever output anything?” (2) There is a decision procedure for the problem. If your answer is true, try to describe the procedure in English or pseudocode for learning purposes. Group of answer choices True False
LANGUAGE MATLAB. Cows cost $10 each, sheep cost $1 each and 8 hens can be bought for $1. Write a program which will buy exactly 100 animals for exactly $100 containing all three types (not just 100 sheep!).
A representation of a desktop test is presented below. Carry out the simulation of the stacking and unstacking process as a desktop test (logical tests without the use of programs), for a factorial of 6.
Computer Science Write a Java program that reads a line and a line segment and then determines whether they intersect or not. When they overlap completely, consider that as intersecting. Use variables ((lp1x, lp1y), (lp2x, lp2y)) to represent a line and ((sp1x, sp1y), (sp2x, sp2y)) to represent a line segment
Please help me by showing how to take input a multiword string in Java and print it in output console window. Please give a sample program for better understanding.