Homework Answers
Answer
b)
Explanation
There is S transition on a blank symbol _ which is moving left and checking whether it has _
Above means, there is left side infinite tape
If it reaches the end of the string, it checks whether the symbol is _ which means the right end has a _
Above means, there is right side infinite tape.
Please up vote
Answer and explain your answer QUESTION 5 A Turing machine M with start state go and...
Answer and explain your answer
QUESTION 5 A Turing machine M with start state go and accepting state of has the following transition function: 1 8(q,a) 0 B 40 (90,1,R) (91,1,R) (9f,B,R) 91 (42,0,L) (42,1,L) (92,B,L) 42 (90,0,R) 9f Deduce what M does on any input of O's and I's. Hint: consider what happens when M is started in state qo at the left end of a sequence of any number of 0's (including zero of them) and a 1....
7. (Exercise 8.5.1) Simulating a Turing machine. Here is a description of a Turing machine. The...
7. (Exercise 8.5.1) Simulating a Turing machine. Here is a description of a Turing machine. The input alphabet is {a, b}. The state set is: {90, 91, 92, 93, 94, qacc, Cre; } The transition function is given in the table below: 90 9 42 93 94 a (qı, a, R) (qı, a, R) (q2, a, R) (qace, a, R) (qej, a, R) b (q2, b, R) (qı, b, R) (qı, b, R) (qrej, b, R) (qace, b, R) **...
I need C and D please 2. Let M be the Turing machine defined by ,...
I need C and D please
2. Let M be the Turing machine defined by , B, R 92, C, 42 2, b, L 2 a, L a) Trace the computation for the input string abcab. b) Trace the first six transitions of the computation for the input string abab. c) Give the state diagram of M. d) Describe the result of a computation in M.
Introduce a Turing machine to decide the languages to follow. You must Algorithmic description, but with...
Introduce a Turing machine to decide the languages to follow. You must Algorithmic description, but with a sufficient level of detail. You can use the variants of the original model of the Turing machine. {w w^R w | where w is a word formed by 0's and 1's} {w ∈ {a, b}∗| w is a palindrome and has the same number of a's and b's}. Please describe which variant of Turing whether it is with a tape or multi tape....
What is the language of accepted strings by the below Turing machine? {a*b*} {ambn | m,...
What is the language of accepted strings by the below Turing
machine?
{a*b*}
{ambn | m, n ≥ 0}
{ambm | m ≥ 0}
{ambnam | m,
n ≥ 0}
This Turing machine is non-deterministic, so it cannot accept a
deterministic language.
( R) go 9 q 93 (9,X, R) (91a, R) (qa, a, L) (hra, R) (h. b, R) (92. y, L) Ø (h. 6, R) 0 0 (qox, R) 0 (93, y, R) (. y, R) (92 y,...
Turing Machines - Models of Language and Computation 8. (7 points) Consider the deterministic Turing machine M (s, t, h), includes fa, b, u) and possibly other symbols, H following rules, along with...
Turing Machines - Models of Language and Computation
8. (7 points) Consider the deterministic Turing machine M (s, t, h), includes fa, b, u) and possibly other symbols, H following rules, along with possibly other rules: (K, Σ, δ, s,H), where K (h), and includes the 6(s,凵) = (t,-) δ(t, a) = (t,-) 6(r,L) = (h, a) Here凵represents a blank. Suppose M is started in the configuration 凵aababaa in the start state with the read write head scanning the blank...
1. (TM descriptions) (a) Give the sequence of configurations that the following TM M enters when...
1. (TM descriptions) (a) Give the sequence of configurations that the following TM M enters when given as input strings 1##1 and 0#0. Please use the same representation for your configurations as we did in lecture 10. The reject state and transitions to the reject state are not shown. Whenever the TM encounters a character for which there is no explicit transition that means that the TM goes to the reject state. We say that the head moves right in...
1. Consider machine M-(Q, Σ. Γ. δ.ql, qaccept, qreject), where Q-{qi, q2, q3, qaccept, qreject}, -{0.1), Г-{0.1 Ủ}, and the transition function as follows is δ (qi, U)-Greject, U, R) Prove that M is...
1. Consider machine M-(Q, Σ. Γ. δ.ql, qaccept, qreject), where Q-{qi, q2, q3, qaccept, qreject}, -{0.1), Г-{0.1 Ủ}, and the transition function as follows is δ (qi, U)-Greject, U, R) Prove that M is NOT a decider Describe in mathematical terms the language A that M recognises, and verify 1. ii. your answer, ie prove that A-L(M) iii. Is A Turing-decidable? [No need for a formal proof, but give clear reasons for your answer
1. Consider machine M-(Q, Σ. Γ....
a) What language is accepted by the Turing machine d(%-a)-(%-a, R), d(%-a)-(9-a, R). (5) Design a...
a) What language is accepted by the Turing machine d(%-a)-(%-a, R), d(%-a)-(9-a, R). (5) Design a Turing machine that will accept language OL-L6.a) (6) Design a Turing machine that will calculate fx)-3x. You must show the representation of s and 3x on the tape of Turing machine when the calculation starts and ends, respectively Extra Questions (20 points) 1. Fill the proper words in the blank (1) Given alphabet Σ, a language on Σ isa (2) Given a grammar G,...
1. Fill out the following blanks for the instructions of a Turing machine that would move an inpu...
1. Fill out the following blanks for the instructions of a Turing machine that would move an input string over (a, b) to the right one cell position. The tape head initially is at the left end of the input string. The rest of the tape cells are blank. The machine will move the entire string to the right one cell position and leave all remaining tape cells blank. The tape head ends at the right end of the output...
Answer and explain your answer
QUESTION 5 A Turing machine M with start state go and accepting state of has the following transition function: 1 8(q,a) 0 B 40 (90,1,R) (91,1,R) (9f,B,R) 91 (42,0,L) (42,1,L) (92,B,L) 42 (90,0,R) 9f Deduce what M does on any input of O's and I's. Hint: consider what happens when M is started in state qo at the left end of a sequence of any number of 0's (including zero of them) and a 1....
7. (Exercise 8.5.1) Simulating a Turing machine. Here is a description of a Turing machine. The input alphabet is {a, b}. The state set is: {90, 91, 92, 93, 94, qacc, Cre; } The transition function is given in the table below: 90 9 42 93 94 a (qı, a, R) (qı, a, R) (q2, a, R) (qace, a, R) (qej, a, R) b (q2, b, R) (qı, b, R) (qı, b, R) (qrej, b, R) (qace, b, R) **...
I need C and D please
2. Let M be the Turing machine defined by , B, R 92, C, 42 2, b, L 2 a, L a) Trace the computation for the input string abcab. b) Trace the first six transitions of the computation for the input string abab. c) Give the state diagram of M. d) Describe the result of a computation in M.
What is the language of accepted strings by the below Turing
machine?
{a*b*}
{ambn | m, n ≥ 0}
{ambm | m ≥ 0}
{ambnam | m,
n ≥ 0}
This Turing machine is non-deterministic, so it cannot accept a
deterministic language.
( R) go 9 q 93 (9,X, R) (91a, R) (qa, a, L) (hra, R) (h. b, R) (92. y, L) Ø (h. 6, R) 0 0 (qox, R) 0 (93, y, R) (. y, R) (92 y,...
Turing Machines - Models of Language and Computation
8. (7 points) Consider the deterministic Turing machine M (s, t, h), includes fa, b, u) and possibly other symbols, H following rules, along with possibly other rules: (K, Σ, δ, s,H), where K (h), and includes the 6(s,凵) = (t,-) δ(t, a) = (t,-) 6(r,L) = (h, a) Here凵represents a blank. Suppose M is started in the configuration 凵aababaa in the start state with the read write head scanning the blank...
1. (TM descriptions) (a) Give the sequence of configurations that the following TM M enters when given as input strings 1##1 and 0#0. Please use the same representation for your configurations as we did in lecture 10. The reject state and transitions to the reject state are not shown. Whenever the TM encounters a character for which there is no explicit transition that means that the TM goes to the reject state. We say that the head moves right in...
1. Consider machine M-(Q, Σ. Γ. δ.ql, qaccept, qreject), where Q-{qi, q2, q3, qaccept, qreject}, -{0.1), Г-{0.1 Ủ}, and the transition function as follows is δ (qi, U)-Greject, U, R) Prove that M is NOT a decider Describe in mathematical terms the language A that M recognises, and verify 1. ii. your answer, ie prove that A-L(M) iii. Is A Turing-decidable? [No need for a formal proof, but give clear reasons for your answer
1. Consider machine M-(Q, Σ. Γ....
a) What language is accepted by the Turing machine d(%-a)-(%-a, R), d(%-a)-(9-a, R). (5) Design a Turing machine that will accept language OL-L6.a) (6) Design a Turing machine that will calculate fx)-3x. You must show the representation of s and 3x on the tape of Turing machine when the calculation starts and ends, respectively Extra Questions (20 points) 1. Fill the proper words in the blank (1) Given alphabet Σ, a language on Σ isa (2) Given a grammar G,...
1. Fill out the following blanks for the instructions of a Turing machine that would move an input string over (a, b) to the right one cell position. The tape head initially is at the left end of the input string. The rest of the tape cells are blank. The machine will move the entire string to the right one cell position and leave all remaining tape cells blank. The tape head ends at the right end of the output...
Most questions answered within 3 hours.
-
ORGANIC CHEMISTRY QUESTION 5
PART A--------
Describe a chemical test for the identification of a double...
asked 58 minutes ago -
Both Terence and Tong work at a local actuarial consulting firm
in Des Moines.
Terence arrives...
asked 1 hour ago -
QUESTION 11
. THE RESTING POTENTIAL IS CAUSED BY
.
. A.
. the rotation of...
asked 1 hour ago -
Need them in c++
1. Give the code for the
definition of a node for
the linked implementation of
a tree that contains...
asked 1 hour ago -
For sputtering-cleaning and sputter-depositing a metal,
would you use an AC or DC plasma? Explain your...
asked 1 hour ago -
Defend ONE of the following statements:
Prices should reflect the value consumers are willing to
pay....
asked 1 hour ago -
A magnet of mass 0.10 kg is dropped from rest and falls
vertically through a 20.0...
asked 1 hour ago -
A friend approaches you about a nutritional product and ask you
if it is worth it....
asked 1 hour ago -
What is bacterial transformation? What are the differences and
similarities between transforming a bacterial cell with...
asked 1 hour ago -
A wire loop 20 cm high is dipped in soap solution and then held
vertically to...
asked 1 hour ago -
OK, now you're all mixed up and you slam into the wall with your
car (total...
asked 1 hour ago -
1. A.Explain why the spread (variance) of a sampling
distribution for estimating a mean would be...
asked 2 hours ago