Homework Answers
Answer:
d) Non-deterministic PDA
Explanation:
>> Non determistic PDA will access only the top of the stack unlike turing machine which can access any position on tape so NPDA is not equivalent to TM.Option d is wrong.
>> Post machine is a simple type of turing machine with different computation technique so post machine is equivalent to TM.Option a is correct.
>> 2PDA contains 2 stacks which can replicate turing machine (one stack before the head and another stack after the head) so 2PDA is equivalent to TM.Option b is correct.
>> Two way infinite tape turing machine can move in ant direction infinitely and TM is sub set of 2 way infinite tape turing machine so both are equivalent.Option c is correct.
Add Answer to:
Question 5 3 pts Which of the following is not equivalent to Turing Machines? Post Machine...
3. (1 point) Which of the following is true of PDA's? A. The stack of a...
3. (1 point) Which of the following is true of PDA's? A. The stack of a PDA is unbounded in terms of the numbers of symbols it can store. B. A transition of the form (q, a, 8) = (r,c) corresponds to the PDA transitioning from state q to state s by reading a from the input string, popping nothing from the stack, and pushing r on the stack. Page 2 of 8 C. A transition of the form 8(q,a,s)...
Problem 3: Turing Machine Models Turing-Recognisablity and Decidability [20] a. Show that an FA w...
Subject : Theory of Computation
Please answer , posting second time now cause nobody answered it
previously
Problem 3: Turing Machine Models Turing-Recognisablity and Decidability [20] a. Show that an FA with a FIFO queue is Turing universal (i.e equivalent in computational power to a Turing machine). You should regard this machine as being formally defined in a way that is very similar to a PDA, except that on each transition, instead of pushing and/or popping a character, the machine...
Question 5 Is the following problem decidable: Given two Turing machines Mi and M2 and an...
Question 5 Is the following problem decidable: Given two Turing machines Mi and M2 and an input a, does Mi stop on z and M2 does not stop on a (gets to an infinite loop)?
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...
Recall the Turing machine we designed in class. Consider an infinite tape with the following initial...
Recall the Turing machine we designed in class. Consider an infinite tape with the following initial state: _ _ _ _word _ _ _ _ Where word is a binary word (i.e. ones and zeros). Right a Turing machine which checks if the word is divisible by 2 or not. Structure your answer as either a state table, or state diagram.
5. Design a Turing machine that takes as input two numbers a and b, such that...
5. Design a Turing machine that takes as input two numbers a and b, such that a is not equal to b and determines which number is higher. Give the transition table for the machine. Show by drawing the steps, how the machine works when a-3 and b-2. Can we use a PDA for the same problem? Give reasons for your answer (10+5+5-20).
s S s 1 S S 2. (10 Points) We wish to construct a Turing Machine...
s S s 1 S S 2. (10 Points) We wish to construct a Turing Machine M (Q,E,F, 8, 8, qaccept, Greject) that decides the language L = {W € {0,1}* ||w| > 2 and w ends in 00 or in 01}. We choose Q = {s, 41, 42, Gaccept, Greject}, { = {0,1}*, T = EU{-} and the transitions: 0 0 R 1 R 91 L 0 L 42 L 91 Greject R 42 0 Paccept 0 R 92...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, an...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, and prove your answer. (Hint: a finite state automata is less powerful than a pushdown automata, which in turn is less powerful than a Turing Machine.) For example, to prove a language needs a PDA to accept it, you would use the Pumping Lemma to show it is not regular, and then build the PDA or CFG that...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, and prove your answer. (Hint: a finite state automata is less powerful than a pushdown automata, which in turn is less powerful than a Turing Machine.) For example, to prove a language needs a PDA to accept it, you would use the Pumping Lemma to show it is not regular, and then build the PDA or CFG that...
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın gua...
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın guage of all palindromes over alphabet {a, b} . Please give both the high-level description (text description or pseudo-code algorithm) and the low-level state transition diagram. Please analyze how many steps (one transition is considered as a step) it takes to accept an input palindrome with n symbols . Please design a deterministic Turing machine with two semi-infinite tapes for the same language. Please give...
3. (1 point) Which of the following is true of PDA's? A. The stack of a PDA is unbounded in terms of the numbers of symbols it can store. B. A transition of the form (q, a, 8) = (r,c) corresponds to the PDA transitioning from state q to state s by reading a from the input string, popping nothing from the stack, and pushing r on the stack. Page 2 of 8 C. A transition of the form 8(q,a,s)...
Subject : Theory of Computation
Please answer , posting second time now cause nobody answered it
previously
Problem 3: Turing Machine Models Turing-Recognisablity and Decidability [20] a. Show that an FA with a FIFO queue is Turing universal (i.e equivalent in computational power to a Turing machine). You should regard this machine as being formally defined in a way that is very similar to a PDA, except that on each transition, instead of pushing and/or popping a character, the machine...
Question 5 Is the following problem decidable: Given two Turing machines Mi and M2 and an input a, does Mi stop on z and M2 does not stop on a (gets to an infinite loop)?
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...
Recall the Turing machine we designed in class. Consider an infinite tape with the following initial state: _ _ _ _word _ _ _ _ Where word is a binary word (i.e. ones and zeros). Right a Turing machine which checks if the word is divisible by 2 or not. Structure your answer as either a state table, or state diagram.
5. Design a Turing machine that takes as input two numbers a and b, such that a is not equal to b and determines which number is higher. Give the transition table for the machine. Show by drawing the steps, how the machine works when a-3 and b-2. Can we use a PDA for the same problem? Give reasons for your answer (10+5+5-20).
s S s 1 S S 2. (10 Points) We wish to construct a Turing Machine M (Q,E,F, 8, 8, qaccept, Greject) that decides the language L = {W € {0,1}* ||w| > 2 and w ends in 00 or in 01}. We choose Q = {s, 41, 42, Gaccept, Greject}, { = {0,1}*, T = EU{-} and the transitions: 0 0 R 1 R 91 L 0 L 42 L 91 Greject R 42 0 Paccept 0 R 92...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, and prove your answer. (Hint: a finite state automata is less powerful than a pushdown automata, which in turn is less powerful than a Turing Machine.) For example, to prove a language needs a PDA to accept it, you would use the Pumping Lemma to show it is not regular, and then build the PDA or CFG that...
(9 pts 3 pts each) For each of the following languages, name the least powerful type of machine that will accept it, and prove your answer. (Hint: a finite state automata is less powerful than a pushdown automata, which in turn is less powerful than a Turing Machine.) For example, to prove a language needs a PDA to accept it, you would use the Pumping Lemma to show it is not regular, and then build the PDA or CFG that...
. Please design a standard TM (i.e., a single semi-infinite tape, deterministic) for the laın guage of all palindromes over alphabet {a, b} . Please give both the high-level description (text description or pseudo-code algorithm) and the low-level state transition diagram. Please analyze how many steps (one transition is considered as a step) it takes to accept an input palindrome with n symbols . Please design a deterministic Turing machine with two semi-infinite tapes for the same language. Please give...
Most questions answered within 3 hours.
-
How could meeting industry expectations, propel managers into
challenging and possible conflict of interest situations? How...
asked 11 minutes ago -
You have been married to your spouse for 10 years. You have two
small children (ages...
asked 2 hours ago -
Spiderman makes a leap from one building to
another. He starts on one building that is...
asked 2 hours ago -
A
symbol is something that stands for something else. What are the
symbols in education?what are...
asked 2 hours ago -
The charge to the left in the figure above has a
magnitude of 2.90 nC, and...
asked 3 hours ago -
Verify the MIRR is 9.29% given cash flows in years 1 and 2 of
$1,000 each,...
asked 4 hours ago -
Calculate the pH of a 5.7 M solution of aniline (C6H5NH2; Kb =
3.8 x 10^-10)
asked 6 hours ago -
LSL R3, R3, R12
Memory
Address
Orig.
Data
Updated
Data
Register
Orig.
Data
Updated
Data
0x84F0...
asked 6 hours ago -
Air at 100 kPa and density of 1.2 kg/m3 flows upward through a
5-cm diameter inclined...
asked 6 hours ago -
Define the following concepts in your own words: (a) stiffness,
(b) strength, (c) strain,
(d) ductility,...
asked 7 hours ago -
In C++
In this homework, you will be tasked with creating functions to
manipulate strings that...
asked 8 hours ago -
An isolated colony represents a pure culture. one rare occasions
, however , a colony can...
asked 8 hours ago