Consider the TM with Q = q0, q1, q2, f, S = {0,1}, G= (0,1,b} (∆...
Consider the TM with Q = q0, q1, q2, f, S = {0,1}, G= (0,1,b} (∆ for blank), initial state q0 and final state f, with transition defined below:
(q0, 0) → (q1, 1, R); (q1,1) → (q2, 0, L); (q2, 1) →(q0,1,R); (q1, ∆) →(f, ∆, R)
(a) Provide the execution trace of this machine on the input 011
(b) Describe the language accepted by the TM
(c) Suppose the transition (q0, 0) → (q1, 1, R) is replaced by
(q0, 0) → {(q1, 1, R); (q0, 0, R)}. Describe the language accepted by the new TM (Note that this new machine is non-deterministic.)
Homework Answers
Request Answer!
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
Consider the following two TM (a) and (b). Here q0 is the starting state and h is the halting (fi...
Consider the following two TM (a) and (b). Here q0 is the starting state and h is the halting (final state). A is blank symbol. Other tape symbols are 1, and X. The other q's are intermediate states. X is meant to replace 1 while reading an input string of 1's. Consider a unary representation of number 4 and number 3. That is input as A111A and A111A Trace the result for each of the TM and interpret what these...
3.(4 4+20-36 points Formal Definition of a Turing Machine (TM) ATM M is expressed as a...
3.(4 4+20-36 points Formal Definition of a Turing Machine (TM) ATM M is expressed as a 7-tuple (Q, T, B, ? ?, q0,B,F) where: . Q is a finite set of states T is the tape alphabet (symbols which can be written on Tape) .B is blank symbol (every cell is filled with B except input alphabet initially .2 is the input alphabet (symbols which are part of input alphabet) is a transition function which maps QxTQxTx (L, R :...
7.1 12) What language is accepted by the pda M = ({q0,q1,q2,q3,q4,q5}, {a,b}, {0,1,z}, , q0,...
7.1 12) What language is accepted by the pda
M = ({q0,q1,q2,q3,q4,q5}, {a,b}, {0,1,z}, , q0, z,
{q5}),
with
(q0,b,z) =
{(q1,1z)},
(q1,b,1)= {(q2,
11)},
(q2,a,1)= {(q3,
)},
(q3,a,1)= {(q4,
)},
(q4,a,z)= {(q4,
z), (q5, z)}
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were...
Help with answering the question at the bottom. Example of Reading an NFA Q = {q0,...
Help with answering the question at the bottom. Example of Reading an NFA Q = {q0, q1, q2, q3, q4} F = {q2, q4} L(M) = {x | x is a binary number that has 2 consecutive 0's or 2 consecutive 1's} = (0|1)^* (00|11) (0|1)^* Trs(q0, 0) = {q0, q3} (q0)--0à(q3) also, loop on q0 on 0,1 Trs(q0, 1) = {q0, q1} --1à(q1) Trs(q1, 1) = {q2} (q1)--1à((q2)) Trs(q2, 0/1) = {q2} loop on q2 on 0,1 Trs(q3, 0}...
turing machine transition table Use the input and table to execute. Input: babaaa b a (q2,...
turing machine transition table
Use the input and table to execute. Input: babaaa b a (q2, b, R) (q1, b, R) (q0, a, L) qo (q3, *, L) (q1,* L) (q2, a, L) 97 (q2, b, R) (q1,* R) (q0, a, R) q2 (q3, *, R) (q1, b, R) (q0, a, R) q3 First 6 characters of the tape after step 1: Ex: *abb*b Select the state of the Turing Machine after each step: Step 1
Use the input and...
3. (8) Let L be the language accepted by the following finite state machine: q0 q1...
3. (8) Let L be the language accepted by the following finite state machine: q0 q1 q2 q3 Answer Yes or No: Does each of the following regular expressions correctly describe L? (1) (a uba)bb'a (2) (EU b)a(bb%)* (3) ba u ab*a (4) (a ba)(bb*a)*
Feed 0011 and 0101 into the transition table: 0 1 x y b q1 (q1,x,R) (q3,y,R) q2 (q1,0,R) (q2,Y,L) (q1,y,R) q3 (q2,0,L) (q0,X.R) (q2,Y,L) q4 (q3...
Feed 0011 and 0101 into the transition table: 0 1 x y b q1 (q1,x,R) (q3,y,R) q2 (q1,0,R) (q2,Y,L) (q1,y,R) q3 (q2,0,L) (q0,X.R) (q2,Y,L) q4 (q3,Y,R) Halt
Question 6 Consider the Turing Machine (TM) T (over the input alphabet Σ = {a, b})...
Question 6
Consider the Turing Machine (TM) T (over the input
alphabet Σ = {a, b}) given below.
(b,b,R) (a.a, R) (b.b,,R) (A,A,L) 1 Start 2 نيا 4 Halt (a, a,R) (a, a,R) (b,b,R) (A,A,R) Trace the execution of the TM on a few strings of as and bs so that you can see how it works and answer the following questions. 6.1. What is the shortest word that would be accepted by T? (2) 6.2. What is accept(T)? (2)...
Consider machine M (Q. Σ , Γ, δ, q1, qaccept, qreject), where Q ,{qi, q2, gs, qaccept, qreject}, Σ as follows: { 0.1 } , Γ { 0.1 U } , and the transition function δ is δ (qi. Ú)-(qreject, U, R) δ (qi...
Consider machine M (Q. Σ , Γ, δ, q1, qaccept, qreject), where Q ,{qi, q2, gs, qaccept, qreject}, Σ as follows: { 0.1 } , Γ { 0.1 U } , and the transition function δ is δ (qi. Ú)-(qreject, U, R) δ (qi, 0)-(P-0, R) -(Gaccept, Prove that M is NOT a decider Describe in mathematical terms the language A that M recognises, and verify 1. your answer, ie prove that A- L(M)
Consider machine M (Q. Σ ,...
8. Suppose that S = {A,B,...,F} is a set of states and I = O = {0,1} are the input and output alp...
8. Suppose that S = {A,B,...,F} is a set of states and I = O =
{0,1} are the input and output alphabets for the Mealy machine
described by the transition table below.
8. Suppose that S-A, B... . F} is a set of states and I- O- 10, 1} are the input and output alphabets for the Mealy machine described by the transition table below a) Construct a state diagram for this Mealy machine. (Layout the states so that...
Consider the following two TM (a) and (b). Here q0 is the starting state and h is the halting (final state). A is blank symbol. Other tape symbols are 1, and X. The other q's are intermediate states. X is meant to replace 1 while reading an input string of 1's. Consider a unary representation of number 4 and number 3. That is input as A111A and A111A Trace the result for each of the TM and interpret what these...
3.(4 4+20-36 points Formal Definition of a Turing Machine (TM) ATM M is expressed as a 7-tuple (Q, T, B, ? ?, q0,B,F) where: . Q is a finite set of states T is the tape alphabet (symbols which can be written on Tape) .B is blank symbol (every cell is filled with B except input alphabet initially .2 is the input alphabet (symbols which are part of input alphabet) is a transition function which maps QxTQxTx (L, R :...
7.1 12) What language is accepted by the pda
M = ({q0,q1,q2,q3,q4,q5}, {a,b}, {0,1,z}, , q0, z,
{q5}),
with
(q0,b,z) =
{(q1,1z)},
(q1,b,1)= {(q2,
11)},
(q2,a,1)= {(q3,
)},
(q3,a,1)= {(q4,
)},
(q4,a,z)= {(q4,
z), (q5, z)}
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were...
turing machine transition table
Use the input and table to execute. Input: babaaa b a (q2, b, R) (q1, b, R) (q0, a, L) qo (q3, *, L) (q1,* L) (q2, a, L) 97 (q2, b, R) (q1,* R) (q0, a, R) q2 (q3, *, R) (q1, b, R) (q0, a, R) q3 First 6 characters of the tape after step 1: Ex: *abb*b Select the state of the Turing Machine after each step: Step 1
Use the input and...
3. (8) Let L be the language accepted by the following finite state machine: q0 q1 q2 q3 Answer Yes or No: Does each of the following regular expressions correctly describe L? (1) (a uba)bb'a (2) (EU b)a(bb%)* (3) ba u ab*a (4) (a ba)(bb*a)*
Question 6
Consider the Turing Machine (TM) T (over the input
alphabet Σ = {a, b}) given below.
(b,b,R) (a.a, R) (b.b,,R) (A,A,L) 1 Start 2 نيا 4 Halt (a, a,R) (a, a,R) (b,b,R) (A,A,R) Trace the execution of the TM on a few strings of as and bs so that you can see how it works and answer the following questions. 6.1. What is the shortest word that would be accepted by T? (2) 6.2. What is accept(T)? (2)...
Consider machine M (Q. Σ , Γ, δ, q1, qaccept, qreject), where Q ,{qi, q2, gs, qaccept, qreject}, Σ as follows: { 0.1 } , Γ { 0.1 U } , and the transition function δ is δ (qi. Ú)-(qreject, U, R) δ (qi, 0)-(P-0, R) -(Gaccept, Prove that M is NOT a decider Describe in mathematical terms the language A that M recognises, and verify 1. your answer, ie prove that A- L(M)
Consider machine M (Q. Σ ,...
8. Suppose that S = {A,B,...,F} is a set of states and I = O =
{0,1} are the input and output alphabets for the Mealy machine
described by the transition table below.
8. Suppose that S-A, B... . F} is a set of states and I- O- 10, 1} are the input and output alphabets for the Mealy machine described by the transition table below a) Construct a state diagram for this Mealy machine. (Layout the states so that...
Most questions answered within 3 hours.
-
Calculate the pH of each of the following solutions.
0.50 M HBr
3.1×10−4 M KOH
4.2×10−5...
asked 1 hour ago -
For the year ended December 31, Depot Max’s cost of merchandise
sold was $85,600. Inventory at the...
asked 1 hour ago -
Week 10 - Professional Memo Assignment
Professional Memo Assignment
Your mission for this week, should you...
asked 1 hour ago -
Write a Python program that stores the data for each
player on the team, and it...
asked 1 hour ago -
In
the last 3 months, mike never knows when he is going to get his
allowance...
asked 2 hours ago -
Is Ca(OH)2 a Bronsted base, Lewis base, or both? Why?
asked 1 hour ago -
1A- Why don’t voters complain about U.S. tariffs on imported
sugar?
Because sugar is only a...
asked 2 hours ago -
Cash Payback Period
Primera Banco is evaluating two capital investment proposals for
a drive-up ATM kiosk,...
asked 2 hours ago -
Create a button in Swift (Xcode) that will create a charge,
create a charge using Stripe's...
asked 2 hours ago -
The reaction rate of CO and NO2 in the reaction
CO(g) + NO2(g) → CO2(g) +...
asked 2 hours ago -
Imagine that a chemist puts 6.40 mol each of
C3H8 and O2 in a 1.00-L container...
asked 2 hours ago -
How much money should be invested today in order to have $8340
at the end of...
asked 2 hours ago