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

Related questions

Q: entation for plotting class0, class1 with 96 points, where the low and high uniform of class0 for…

A: Write a python program of perceptron implementation for plotting class0, class1 with 96 points,…

Q: Write a java program so that it prints the given word with the first and last character…

A: The answer is given below:-

Q: Write a Java Program to take two strings from the user ka and b, print the result of putting them…

A: Java is a high level,class based, object-oriented programming language that is designed to have as…

Q: Write a Java program to take 2 strings from user a and b, return a string of the form…

A: With the shorter string on the outside and the longer string on the inside. The strings will not be…

Q: Write Java classes to implement the following: Problem 1. Input three strings s1, s2, and s3 from…

A: According to the question below the solution: Output:

Q: Write a Java program that reads a sentence consisting of five words and determines the shortest word…

A: In computer programming, there are various ways to solve a problem. For simple tasks like finding…

Q: Write a Java program that reads one line of input text and breaks it up into words. The words should…

A: 1. accept string line from the user. declared carry= true and i=0. 2. In the while loop check string…

Q: Write a program that takes a string and integer as input, and outputs a sentence using those items…

A: Please find the answer below

Q: make a algorithm to add two integer numbers. Implement the program in a high level language like C…

A: Algorithm to add two integer numbers: Start Read the first integer from memory location 5000 and…

Q: Write a Java program that takes a string as input and reverses the order of words in the string. For…

A: Step-1) First, creating a Scanner object and system.in is standard input stream as Scanner…

Q: Consider the following incomplete StudentRecord class declaration. Each StudentRecord object stores…

A: Algorithm: Start Create a class named StudentRecord with scores an array as its attribute Implement…

Q: The image is the non-deterministic PDA ,Give CFG for all strings of this

A: Let M = (Q,∑,Γ,q0, Z,F ,δ) be a PDA. If one of the below-given conditions fails, the PDA is…

Q: In Java: Write a program that reads a list of words. Then, the program outputs those words and…

A: Question. Write a program that reads a list of words. Then, the program outputs those words and…

Q: Implement programme provides an example of how to carry out these tasks. The string "Hello world" is…

A: Answer the above program are as follows

Concept explainers

Problems on Turing Machines

In the computational world, the Turing machine is a powerful computation engine. The invention of the Turing Machine is done by Alan Turing in 1936. A Turing Machine (TM) is a diagrammatic model of a fictional computer. It determines an output from a set of input variables using a pre-defined set of rules. It is used to get around the limitations of finite automata and pushdown automata.

Question

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.
Dickinson
3. 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 symbol
2
4. 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 a
member of P? Why or why not?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Overview

VIEW

Step 2: Explanation

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

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 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.
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
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
Write a Java Program to take a string from the user and Your task is to find the length of longest palindrome string that can be made from that string.
Write a Java procedural program that helps organise travellers with a specific travel company arriving at an airport, telling them which queue to join based on their hotel. The program asks each traveller what their hotel is (the choices are the Seaview for which they need to join Queue 1, the Majestic for which they need to join Queue 4 and the Grand for which they need to join Queue 7) and tells them the right queue. There are 1330 travellers with the tour company and each will use the program as they arrive. After all have indicated their hotel, the program then prints the percentage in each hotel. * See image for an example run of the program. Percentages should be printed truncated to two decimal places. Do this using a method you write yourself that multiplies by 100, converts to an integer then divides by 100. * must make use of a counter-controlled for loop, be in procedural programming style (not OOP)
Write a Java program to take a string and a non-negative int n, þrint a larger string that is n copies of the original string.
Given a Java program p and the input 0, consider the problem, “Does p ever output anything?” (1) There is a semi-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