Give a description representation of a Turing Machine Mg for language B = {w over {0, 1,#3*| w contains an equal number of O's and 1's and w contains exactly 1 #"}. 10# E B, 01#10 EB,01##01 € Band #001 € B. In this case, your description should be for a single tape TM.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 writingon the tape (and which tape if you use more than 1), the direction in which the tape heads willmove, and when the Turing Machine should halt and accept and/or halt and reject. Having saidthat, 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 toread/write in which order, in which directions the tape would move and how you reachaccept/reject decision.

Answer: 1. Turing machine consists of a set Q of states. 2. At any stage of computation, the TM…

Give a description representation of a Turing Machine Mg for language B = {w over {0, 1, #)* | w contains an equal number of O's and 1's and w contains exactly 1 '#'). 10# € B, 01#10 E B, 01##01 € Band #001 € B. In this case, your description should be for a single tape TM.

Give a description representation of a Turing Machine Mg for language B = {w over {0, 1, #)* | w contains an equal number of O's and 1's and w contains exactly 1 '#'). 10# € B, 01#10 E B, 01##01 € Band #001 € B. In this case, your description should be for a single tape TM.

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: Set Let S = {1, 4} and T = {a, b, c}, computer: S X T = S X S = |T| = T − S = P(S) =

Q: For each of the following regular expressions find a language (i.e., a set of strings) over A =…

A: Regular expressions are symbolic representations of patterns that define sets of strings. The…

Q: Which of the followings is a representation for the set {x | a < x < b} [a,b) (a,b) (a,b] [a,b]

A: The x lies between a and b. Since there is no equal sign between a and x and even there is no equal…

Q: Sample Input Sample Output 8 10 14 22 11 48 24

A: Step 1:- Program Approach:- 1.Declare the 3 variables of data type integer 2.Declare the 1D array…

Q: C-13.28 Describe an algorithm for constructing the compact representation of a suffix trie, given…

A: Algorithm is a step by step procedure to solve a given problem.

Q: Write a function, called isSymmetric, which returns true if a directed graph is symmetric, false…

A: Dear student, the answer is provided below.

Q: Closure under prefix operator. Prefix operator is defined as: prefix(w E E*) = {w1 .. wk| 0< k <…

A: Closure Under Prefix Operator. Prefix Operator Is Defined As: Prefix(W E **) = {W1 ... Wkl 03 K <…

Q: /** Returns the sum of the integers in given array. */ public static int example1(int[] arr) { int n…

A: Here in this question we have given a code segment and we have asked to give a big oh…

Q: Prove that for all integers n, it is the case that n is even if and only if 3n is even. That is,…

A: Even number divided by 2 gives zero as remainder and odd number divided by 2 gives 1 as remainder.…

Q: Give a description of a TM M, that recognizes language D = {w over {0, 1}*| w contains twice as many…

A: Description of Turing machine LanguageD=w over 0,1*| w contains twice as many 0's as 1's The…

Q: Consider the regular expressions: R1 = (a | b )* (0*1*) ( a | b )* R2 = (a | b ) (0*1*)*( a | b )…

A: Regular expression: the regular expression is used in the string-searching algorithm. It is the…

Q: S is a set of strings over the alphabet {a, b}* recursively defined as: Base case: λ ∈ S, a ∈ S, b…

A: Base case: λ ∈ S, a ∈ S, b ∈ S Recursive rules: If x ∈ S, then Rule 1: axb ∈ S Rule 2: bxa ∈ S

Q: A priority queue is an abstract data type in which each data has a priority associated with it. If…

A: PROGRAM CODE: #include <iostream>#include <queue> using namespace std; void…

Q: Finally, we will do some simple analysis - ranking of words. Write a function word_ranking(corpus,…

A: Python Program: def word_ranking(corpus,n,sort_indes): words = [] for s in corpus: words +=…

Q: Write a Java program using OOP concept that perform the union and symmetric difference between two…

A: Algorithm: Start Create a class named setClass with data(which is set which stores character value)…

Q: Implement the following function in C programming language that get a string, and compute an array…

A: Implement the following function char** get_tokens(const char* str); using c programming as follows,

Q: Create a function that takes the dimensions of two triangles (like the same members) and checks if…

A: Step 1 : Start Step 2 : Define a function doTriangleFit() to check if the first triangle fits in the…

Q: Your task for this assignment is to identify a spanning tree in a connected undirected weighted…

A: 1#include <iostream> 2#include <vector> 3#include <climits> 4 5using namespace…

Q: Show that L = {an! : n2 1} is not context-free. %3D

A: Below is the answer to above question. I hope this will be helpful for you..

Q: Let F(x.y): "x is friend with y", N(x): "x is funny", W(x): "x is wise", R(x): "x is fair". The…

A: English is: Everyone has some friends who are not funny but wise and whom are fair is not friend…

Q: Construct a TM that accepts the following languages. a. L12={a2nbn | n ≥1} b. L5 = {02^n | n ≥1 }.…

A: Answer

Q: 1. Give an implementation-level description of a single tape deterministic Turing machine, M₁, with…

A: A Turing device can be defined in such a way that it is a simple hypothetical gadget that can be…

Q: uppose three algorithms A, B, and C, can be implemented to perform a task. The ilgorithms have the…

A: Answer:- C < A < B explanation:- first, we will know, what is Time Complexity?…

Q: Your company, A to Z Logistics, is in charge of packing shipping containers. Every container has two…

A: To convert the character to it's equivalent weight, using the following formula Input string…

Q: Construct a CFG that generates L, where L is described below: L = {w|w € {a, b}*, #a(x) = #b(x)},…

Q: Python. Please, help me to write such a program in Python! Sequences of integers a1,…, an, b1,…, bm,…

A: Input : Two sequences, a and b Value of k Output : Modify the sequence b if k is not present in a

Q: Design in JFLAP a simulator of a finite deterministic automaton that (only) recognizes Even length…

A: Solution: To designing the finite automata for the even length binary number , We know to that the…

Q: An algorithm to fill any linear structure with all prime numbers between an upper bounding boundary…

A: We will write an algorithm to fill a linear data structure with prime numbers between two bounds and…

Q: A = {r| x = 3d + 2, d e N}, B = {x e Z|a? + 9 = 0}, C = {1,5}. Also assume the Universal set is N:…

Q: Consider a sequence defined on the set of non-negative integers as follows: an = -2(-1)" for n 2 0.…

A: Recursive function is a function that calls itself in its definition directly.

Q: Only in c++. With correct detail answer will upvoted else downvote. There are one feline, k…

A: Here have to determine about c++ code for save mice.

Q: QUESTION 5 Let F(x,y): "x is friend with y", N(x): "x is funny", W(x): "x is wise", R(x): "x is…

A: In given question, we are given a statement and for that first we have to find out the negation…

Q: Given the sets A = { A, B, C, D} and B = {C, D, E}, what is A v B A-B

A: Given sets are: A={A,B,C,D} B={C,D,E} Now , we have to find A U B and A-B.

Q: Consider Java classes C1, C2, and C. C1 is a subclass of C, while C is a subclass of C2. Consider a…

A: SOLUTION- The symbol "c" in the Java expression "c.x() + c.y()" is a reference variable of type…

Q: P(x): "x is a kind-hearted person". Q(x): "x is an honest person".

A: ∃ (there exists ) menas atleast ~q Not a honest person ~p not a kind hearted person So there exists…

Q: Presented with a list of X objects, Mark made a program in Python which does the following: func_1 →…

A: def fun1(l): a=l[-1] for i in range(len(l)-1,0,-1): l[i]=l[i-1] l[1]=a; return…

Q: Write a Perl program that uses a hash and a large number of operations on the hash. For example, the…

Q: Extend the JML definition of Peano from the lecture with a function computing the minimum of two…

A: Answer: Algorithms Step1: We have ask for user input first number Step2: We have ask for user input…

Q: implement a c# program that tests our implementation of the CSet class by creating two sets,…

A: Here's a programme that puts our CSet implementation to the test by establishing two sets,…

Q: Write a program in C to find out a fuzzy set B in Y using the extension principle for r >= 3 You may…

A: # Example to Demonstrate the# Union of Two Fuzzy SetsA = dict()B = dict()Y = dict() A = {"a": 0.2,…

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

Give a description representation of a Turing Machine Mg for language B = {w over {0, 1,
#3*| w contains an equal number of O's and 1's and w contains exactly 1 #"}. 10# E B, 01#10 EB,
01##01 € Band #001 € B. In this case, your description should be for a single tape TM.
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 how you reach
accept/reject decision.

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

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 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

QIX. Construct a TM that accepts the following languages. 12. L12={a?rb" | n 21} 13. L5 = {02^n |n 21 }. i.e., the occurrences of 0 is always powers of 2, means, every time, you can divide the resultant to 2, recursively.
Given the following CFG S → OB A → 1AA|A B → OAA The following strings can be generated except i. 001 ii. 000 iii.0011 iv. 01 O A. i and iii O B. i and ii O C. iv only O D. ii only
Translate into English. Let p = "I am studying Java”, q = “It is sunny”, r = “I am at the beach" For "or" indicate inclusive/exclusive in your English language. a. p^q b. rq c.q→ (pv¬r)
An argument is expressed in English below. The domain is the set of people attending a party. Every person who was late to the party left the party early. There is a person who was late to the party and was not happy. .. There is a person who left the party early and was not happy. The form of the argument is: x (P(x) → Q(x)) 3X (P(x) ^ ¬R(x)) .: 3x (Q(x) ^ ¬R(x)) Select the definitions for predicates P, Q, and R. P(x): Pick Q(x): Pick R(x): Pick
Given a set of object-values, A = {1, 3, 4, 7} and VAL = 6. Implement the Dynamic Programming paradigm to determine whether it is possible to form a summation that equals to value of VAL using any combination of the elements of A where the frequency of use for each element is just one.
The correct statements are: If L₁ and L2 are not regular languages, then L₁ U L₂ cannot be regular. If L₁ and L₂ are regular languages, then L₁ L₂ = {w: w€ (L₁-L₂) or w€ (L₂-L₁)} is regular. It is possible that the union of a regular language and a nonregular language is regular. Every subset of a regular language is regular.
Please help me fill in the blanks The reverse of a string x, denoted rev(x), is the string obtained by writing x backwards. For example, if x = abbaaab then rev(x) = baaabba. If A is a subset of Σ*, the reverse of A, denoted rev(A), is the subset of Σ* consisting of all reverses of strings in A: rev(A)={rev(x) | x∈A} For example, rev({a,ab,aab}) = {a,ba,baa}. Suppose you are given a deterministic finite automaton M accepting a set A. Show how to construct a DFA N accepting rev(A). (Kozen would suggest putting pebbles on the final states of M and moving them backwards along transition edges.) Describe N formally (i.e. in terms of Q, δ, etc.) including the definition of acceptance. Hint: the subset construction will be helpful here. You can start with M = (Q, Σ, δ, s, F) and define the components of N in terms of the components of M. 1. DFA N = (Q_N, Σ, δ_N, s_N, F_N) where Q_N = ___ 2. DFA N = (Q_N, Σ, δ_N, s_N, F_N) where δ_N = ___ 3. DFA N = (Q_N, Σ, δ_N, s_N, F_N)…
= {a'ba' | i > 0}. Let E = {a, b}. Let L = Give a Turing machine (TM) that accepts the language L. Assume ; that, when the TM starts, the head is on a blank symbol, A, and the input string is immediately after that blank symbol on the tape. For example, if the input string were aaabaaa, then the inital tape configuration would be A a a aba a a
Given the following CFG S → OB A → 1AA|A B → OAA The following strings can be generated except i. 001 ii. 000 iii.0011 iv. 01 O A. i and iii O B. i and ii O C. iv only O D. ii only
Regular expressions are built recursively out of smaller regular expressions, using some rules described below. Each regular expression ?denotes a language ?(?), which is also defined recursively from the languages denoted by ?′? subexpressions. Given an alphabet ∑ = {0, 1}, write the language denoted by the following regular expressions:(i) 1(ii) 0 | 1(iii) (0 | 1)(iv) (0 | 1)∗(v) 1(0 | 1)∗(vi) 0 |1 (0| 1)