Fill in the following table and an example of language accepted by each machine
![Fill in the following table and an Device example of language accepted by each machine [10 Points] Deterministic by default?](http://img.homeworklib.com/images/407c64cc-c6e6-479f-ae04-23e7233e6ee1.png?x-oss-process=image/resize,w_560)
Homework Answers
Add Answer to:
Fill in the following table and an example of language accepted by each machine Fill in the following table and an Devi...
Specify in detail a (deterministic) a Turing machine that accepts the language L = a* ba*...
Specify in detail a (deterministic) a Turing machine that accepts the language L = a* ba* (your Turing machine must halt on input w if, and only if, w € L). Remember: since your machine is deterministic, it must have a well-defined behavior for any possible symbol of the input alphabet, i.e, a, b, and #, in each state, except that you only need to ensure that your Turing machine behaves correctly when started in the configuration (s, #w#). Thus,...
5.18. For each of the following languages, give a transition table for a deterministic PDA that...
5.18. For each of the following languages, give a transition table for a deterministic PDA that accepts that language. a. x E a, b* na(x) < nb(x))
Given the following non-deterministic finite state machine: (c) a σ0 o1 σ2 b Find the input...
Given the following non-deterministic finite state machine: (c) a σ0 o1 σ2 b Find the input set V, the accepting states set T, the states set S, and initial (i) state for the machine. (10/100) Write the transition table for the machine (ii) (10/100) (iii) Write the simplest phrase structure grammar, G=(V,T,S,P), for the machine (10/100) Rewrite the grammar you found in question 4(c)(iii) in BNF notation (iv) (10/100) (v) Is the string aabaaba an accepted string by the finite-state...
Show that the language A = {<M1> | the language accepted by the Turing Machine M1...
Show that the language A = {<M1> | the language
accepted by the Turing Machine M1 is 1*} is
not decidable. Present your proof in the style of the proof of Th.
5.3, which shows below.
PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
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,...
(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...
what is the minimal corresponding maching (Finite Automata, Pushdown Automata, or Turing Machine) for each of the following languages? State which method is being used P3) What is the minimal corr...
what is the minimal corresponding maching (Finite Automata,
Pushdown Automata, or Turing Machine) for each of the following
languages? State which method is being used
P3) What is the minimal corresponding machine (FA, PDA or TM) for each of the following languages? (You must provide proper explanations or proofs for your answer.) (30 points) o) L1 (every strings consist with a and b 0, 00,000), 0). (b) L2 balanced parenthesises , For example L2- (a) Ls ab" al n 20)...
(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...
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...
Specify in detail a (deterministic) a Turing machine that accepts the language L = a* ba* (your Turing machine must halt on input w if, and only if, w € L). Remember: since your machine is deterministic, it must have a well-defined behavior for any possible symbol of the input alphabet, i.e, a, b, and #, in each state, except that you only need to ensure that your Turing machine behaves correctly when started in the configuration (s, #w#). Thus,...
5.18. For each of the following languages, give a transition table for a deterministic PDA that accepts that language. a. x E a, b* na(x) < nb(x))
Given the following non-deterministic finite state machine: (c) a σ0 o1 σ2 b Find the input set V, the accepting states set T, the states set S, and initial (i) state for the machine. (10/100) Write the transition table for the machine (ii) (10/100) (iii) Write the simplest phrase structure grammar, G=(V,T,S,P), for the machine (10/100) Rewrite the grammar you found in question 4(c)(iii) in BNF notation (iv) (10/100) (v) Is the string aabaaba an accepted string by the finite-state...
Show that the language A = {<M1> | the language
accepted by the Turing Machine M1 is 1*} is
not decidable. Present your proof in the style of the proof of Th.
5.3, which shows below.
PROOF We let R be a TM that decides REGULARTm and construct TM S to decide ATM. Then S works in the following manner. S - "On input (M, w), where M is a TM and w is a string: 1. Construct the following...
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,...
(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...
what is the minimal corresponding maching (Finite Automata,
Pushdown Automata, or Turing Machine) for each of the following
languages? State which method is being used
P3) What is the minimal corresponding machine (FA, PDA or TM) for each of the following languages? (You must provide proper explanations or proofs for your answer.) (30 points) o) L1 (every strings consist with a and b 0, 00,000), 0). (b) L2 balanced parenthesises , For example L2- (a) Ls ab" al n 20)...
(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...
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...
Most questions answered within 3 hours.
-
You are going to sell fruits & vegetables at a local
roadside market. List separately and...
asked 3 minutes ago -
Hows does water affect the digestion of fats ?
asked 2 hours ago -
A buffer that contains 0.41 M of a base, B and 0.21 M of its
conjugate...
asked 2 hours ago -
Pleaaaaaaaasssssse help me please please it's more important
:((((((((((((((((((((
CASE STUDY
Nissan Company
Nissan Motor Company,...
asked 2 hours ago -
Calculate the concentration of hydronium and hyroxide ions in 1)
2.0 mol/L HNO3 2) 0.5 mol/L...
asked 2 hours ago -
In a loop-the-loop ride a car goes around a vertical, circular
loop at a constant speed....
asked 2 hours ago -
50 grams each of water (18.015 g/mol) and ethylene glycol
(C2H6O2) (62.07 g/mol) are mixed. At...
asked 2 hours ago -
The life expectancy of sport utility vehicles follows a normal
distribution with a mean of 145.8...
asked 3 hours ago -
If an object with mass of 5 kg is pushed with a force of 552 N,...
asked 2 hours ago -
Suppose your program already has a list called nums, which
contains several numbers. Write a for...
asked 3 hours ago -
A spherical shell with a finite thickness just barely floats in
water. If the shell is...
asked 3 hours ago -
Explain in detail whether the following is true or false:
Total factor productivity will rise only...
asked 3 hours ago