TURING MACHINE Here is a description of a Turing machine. The input alphabet is (a, b). The state set is:{90, 9a, qb, qca, qcb, left, acc, arej}The transition function is given in the table below:9⁰qaqbqca(qa, *, R)(qa, a, R)(qb, a, R)(dleft. *, L)(9b, *, R)(qa, b, R)(qb, b, R)(arej, *, R)(qacc*, R)(qca*, L) (9cb.*, L) (qacc.*, R)(a)Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, ithas executed zero steps.ab*qcb(qrej. *, R)(aleft, *, L)(qacc.*, R)gleft(qleft, a, L)(qleft, b, L)(90,*, R)

A Turing machine is a numerical model of calculation portraying a theoretical machine that controls…

Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 9a, qb, acar 9cb, qleft, qacc, grej} The transition function is given in the table below: 90 qa qb qca qcb qleft (qa*, R) (qa, a, R) (qb, a, R) (aleft, *, L) (qrej. *, R) (aleft, a, L) b (qb.*, R) (qa, b, R) (qb, b, R) (arej. *, R) (left,*, L) (left, b, L) * (qacc.*, R) (qca, *, L) (acb.*, L) (qacc.*, R) (qacc.*, R) (qo, *, R) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, it a

Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 9a, qb, acar 9cb, qleft, qacc, grej} The transition function is given in the table below: 90 qa qb qca qcb qleft (qa, R) (qa, a, R) (qb, a, R) (aleft, , L) (qrej. , R) (aleft, a, L) b (qb., R) (qa, b, R) (qb, b, R) (arej. , R) (left,, L) (left, b, L) * (qacc., R) (qca, , L) (acb., L) (qacc., R) (qacc., R) (qo, , R) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, it a

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks

Similar questions

3. Read from Figure 1: Turing Machine 1 the description of turing machine and for how many steps does the Turing machine run on input string "a" before the Turing machine halts? Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 91, 92, 93, 94, 9acc, grej} The transition function is given in the table below: a b * 91 92 (91, a, R) (92, a, R) (q1, b, R) (q2, b, R) (93, *, L) (94, *, L) Figure 1: Turing Machine 1. 9⁰ (9₁, a, R) (92, b, R) (grej, *, R) A. 1 step B. 2 steps C. 3 steps D. 4 steps E. None of the above. 93 (qacc, a, R) (arej, b, R) (grej, *, R) 94 (qrej, a, R) (qacc, b, R) (grej, *, R)
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
Turing Machines 1. Let Turing machine, where Q = {q, 9, h}, E, = {a, b, o, 0}, and the transition function & is given by the following table: q o d(q, a) 9,a (q, b) q,b (q, a) 4,0 (h, D) 4.0 (q, -) 9,a (q, -) 9,b (q,-) 9,0 (9,-) 9,0 (9 -) (a) Trace the computation of M starting from the configuration (qo, aabbba). (b) Describe what M does when started in q, on any length of a tape.
The function f is defined for non-negative integers a and b recursively as follows:f(a, b) ={0 if a = 0 or b = 0f(a − 1, b − 1) + 2a − 1 if a = bf(a − b, b) + f(b, b) if a > bf(a, a) + f(b − a, a) if a < b}Compute f (3, 2) by drawing a recursion tree showing all of the computationrequired and then use your tree to compute the answer.
Problem 4 Turing Machines Construct a Turing machine that recognizes the set of all bit strings that contain at least two l's. You need to define the state transition table in the format used in lectures. That is, f(s;, a) = (s;, A, R) where s; is the current state, s; is the next state, a is the input symbol, A is the output symbol written on tape, and L indicates moving left or R indicates moving right.
= = 2×2 and 6 = (a) A composite number is a positive integer that has at least one divisor other than 1 and itself. For example, 2 1×2 is not a composite number but 4 2 × 3 are composite numbers. A logic circuit has four binary input variables, A, B, C and D. The output Z of the logic circuit is 1 if the unsigned integer represented by the binary number ABCD is a composite number. Using variables A and B for the select inputs S1 and S0 of a 4-to-1 multiplexer, implement the logic function Z(A, B, C, D) using this multiplexor and other logic gates.
FORMAL LANGUAGES AND AUTOMATIC THEORY A Moore-type finite automaton for a language using the alphabet ∑= {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} design. The machine will produce the remainder of the 3 division of the number at the entrance at the exit. For example; If there is 251 at the entrance, the output will be 2. In other words, the remainder of 251 to 3 is 2. As the entrance 144312 arrival will be 0 There is no limit to the length of the input sequence
Given the language, L = {abb, aabb, babb, aaabb, ababb...............,hich of the following is the correct the regular expression that can represent L. O A. (a+b)*ab B. (aa)*(bb)*b O C. (a*ba*) O D. (a+b)*abb
Show the function f(i; k) is primitive recursive where f(i; k) = Pi.Pi+1............Pi+k. Recall, Pn is the nth prime number and P0 = 0.
Exercise 1.A set W of strings of symbols is defined recursively by a, b, and d belong to W. If x belongs to W, so does a(x)d. Provide 3 strings made of 3 letters each belonging to W and show the procedure used to obtain them. Provide 3 strings made of at least 5 letters each belonging to W and show the procedure used to obtain them.
Answer in python language only A very successful cinema director named "Chef" decided to solve the problem. When a customer wants to buy a ticket, the clerk at the ticket window asks the visitor if he or she needs a rest area, and if so, which one: left, right, or both. We know that in the audience they are expected to appear, their L needs a left-handed position, their R needs a right one, Z does not need a single one and B needs both. Your job is to count the number of people who can attend the show. In the theatre there are N rows with each M seat. There is only one lounge between the two adjacent seats. Seats at the beginning and end of the row have two armrests. Help him using the C++ programming language. Input 1 331209 Output: 8
(a) There is a Turing machine that decides the set Ø (b) There is a Turing machine that is not a decider and that recognizes the set Ø. (c) There is a Turing machine that decides the set Σ* (d) There is a Turing machine that is not a decider and that recognizes the set Σ*. (e) There is a Turing machine that decides the set {ww | w€ [*} (f) There is a Turing machine that is not a decider and that recognizes the set {www = [*}