How do I design a Turing Machine which accepts strings that begin with 'a' and end...
How do I design a Turing Machine which accepts strings that begin with 'a' and end with two 'b's. For example, the strings abb and aaabb should be accepted. While the strings bbaa and ab should not be accepted.
Homework Answers
Add Answer to:
How do I design a Turing Machine which accepts strings that
begin with 'a' and end...
Construct a Turing machine with input alphabet {?, ?}, which accepts strings of even length.
Construct a Turing machine with input alphabet {?, ?}, which accepts strings of even length.
Construct a Turing machine with input alphabet {?, ?}, which accepts strings with the same number...
Construct a Turing machine with input alphabet {?, ?}, which accepts strings with the same number of a’s and b’s.
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that...
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that are strings in 10, 1). Design Mi so that it recognizes the following language: fw E (0.1)l w ends in 10 or 111) a. Provide a high-level English prose description for the actions of Mi b. Provide an implementation-level description of M. c. List the parts of the formal 7-tuple for M d. Draw a detailed pictorial state diagram for M1 e. List the...
2. Let L = {hMi: M is a Turing machine that accepts at least two binary strings}. a) Define the notions of a recognisabl...
2. Let L = {hMi: M is a Turing machine that accepts at least two
binary strings}. a) Define the notions of a recognisable language
and an undecidable language. [5 marks] b) Is L Turing-recognisable?
Justify your answer with an informal argument. [5 marks] c) Prove
that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d)
Bonus: Justify with a formal proof your answer to b). [20
marks]
2. Let L-M M): M is a Turing machine that accepts...
2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable...
2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable language and an undecidable language. [5 marks [5 marks] b) Is L Turing-recognisable? Justify your answer with an informal argument. c) Prove that L is undecidable. (Hint: use Rice's theorem.) [20 marks] 20 marks] d) Bonus: Justify with a formal proof your answer to b).
2. Let L-M M): M is a Turing machine that accepts at...
40 points) Please design a Turing machine T to recognize the union of the languages of two Turing...
40 points) Please design a Turing machine T to recognize the union of the languages of two Turing machines Mi and M2. That is, T accepts an input string w, if and only if either Mi or M2 or both accept string w. Please describe the high-level idea (or algorithm) of your Turing machine T. You do not need to draw the low-level state transition diagram of your Turing machine. Note that the difficulty is that Mi or M2 may...
discrete math box answers do A and B please 2. For this problem, all strings are in the set (0,1) a) Design a Finit...
discrete math box answers do A and B please
2. For this problem, all strings are in the set (0,1) a) Design a Finite State Machine that accepts all and only the strings that (start with 0 and end with 1) or (start with 1 and end with 0). E.g. The following strings would be accepted: 010101, 001, 100, 101010, The following strings would not be accepted: 0110, 1010101, 1,0,.. b) Express the set of strings described above as a...
Build a deterministic finite-state machine that accepts all bit strings in which the first and last...
Build a deterministic finite-state machine that accepts all bit strings in which the first and last bits are not the same, and that rejects all other bit strings. This problem requires at least five states. Here are three examples of strings that should be accepted: 01 0010011 11110 Here are three strings that should be rejected: 01010 1 11101
Design a TM (Turing Machine) which writes the reverse of the input word on the tape...
Design a TM (Turing Machine) which writes the reverse of the
input word on the tape after reading the first blank after the
word. The input alphabet is = { &, c, d), and assume the word
starts with &, then with a word from (c+d)*
As an example: input tape is &ccdd..., after
executing the Turing Machine, the tap would contain
&ccddddcc
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe...
Design a determinsitic finite-state automaton that accepts strings(A,B,...,Z) must contain "NG" does not end with Y...
Design a determinsitic finite-state automaton that accepts strings(A,B,...,Z) must contain "NG" does not end with Y any I must be followed by a S(after any number of other letters including another I).
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that are strings in 10, 1). Design Mi so that it recognizes the following language: fw E (0.1)l w ends in 10 or 111) a. Provide a high-level English prose description for the actions of Mi b. Provide an implementation-level description of M. c. List the parts of the formal 7-tuple for M d. Draw a detailed pictorial state diagram for M1 e. List the...
2. Let L = {hMi: M is a Turing machine that accepts at least two
binary strings}. a) Define the notions of a recognisable language
and an undecidable language. [5 marks] b) Is L Turing-recognisable?
Justify your answer with an informal argument. [5 marks] c) Prove
that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d)
Bonus: Justify with a formal proof your answer to b). [20
marks]
2. Let L-M M): M is a Turing machine that accepts...
2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable language and an undecidable language. [5 marks [5 marks] b) Is L Turing-recognisable? Justify your answer with an informal argument. c) Prove that L is undecidable. (Hint: use Rice's theorem.) [20 marks] 20 marks] d) Bonus: Justify with a formal proof your answer to b).
2. Let L-M M): M is a Turing machine that accepts at...
40 points) Please design a Turing machine T to recognize the union of the languages of two Turing machines Mi and M2. That is, T accepts an input string w, if and only if either Mi or M2 or both accept string w. Please describe the high-level idea (or algorithm) of your Turing machine T. You do not need to draw the low-level state transition diagram of your Turing machine. Note that the difficulty is that Mi or M2 may...
discrete math box answers do A and B please
2. For this problem, all strings are in the set (0,1) a) Design a Finite State Machine that accepts all and only the strings that (start with 0 and end with 1) or (start with 1 and end with 0). E.g. The following strings would be accepted: 010101, 001, 100, 101010, The following strings would not be accepted: 0110, 1010101, 1,0,.. b) Express the set of strings described above as a...
Design a TM (Turing Machine) which writes the reverse of the
input word on the tape after reading the first blank after the
word. The input alphabet is = { &, c, d), and assume the word
starts with &, then with a word from (c+d)*
As an example: input tape is &ccdd..., after
executing the Turing Machine, the tap would contain
&ccddddcc
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe...
Most questions answered within 3 hours.
-
''Driving the call for multilateralism in trade at the summit
was Chinese President Xi Jinping, whose...
asked 20 seconds ago -
If X ~ N(50; 100); Determine the value of '' k '' for both
situation:
a)...
asked 5 minutes ago -
In paired t-test, what's the difference between using pooled
variance and using the standard deviation of...
asked 6 minutes ago -
Present one method for changing health behavior that you think is
particularly effective.
Describe how one...
asked 8 minutes ago -
What are the major ethical theories, and how do they apply to
the role of a...
asked 6 minutes ago -
Is Goldicks negligent conduct committed within the
scope of his employment for Lapp Roofing liable
asked 21 minutes ago -
What are the effects of IMC-based PID controller and
Zeigler-Nicholas parameters on the specifications of a...
asked 26 minutes ago -
1. Explain the tem (10) Key Success Factors in Contemporary
Selling
asked 39 minutes ago -
It's absolutely linked, the effectiveness of the CP Coordinator
and the success of the business impact...
asked 48 minutes ago -
where does leadership reside in belief theory
asked 48 minutes ago -
Jane wants to purchase a bond with a face value of $8,595 and a
bond rate...
asked 50 minutes ago -
A bolt manufacturer wants to investigate the machine that
produces bolts with a diameter of 0.28...
asked 52 minutes ago