$20 Bonus + 25% OFF
Securing Higher Grades Costing Your Pocket?
Book Your Assignment at The Lowest Price
Now!
Students Who Viewed This Also Studied
COMP 3030 Automata Theory and Formal Languages
Questions:
• Notation: for any string W and any symbol x , we write #x (W )to represent the number of occur-rences of symbol x in W Examples: #0(“)=0, #1(“)=0, #0(0010)=3, #1(0010)=1, #0(111)=0
• In this assignment, if you need to prove something is recognizable or decidable, you should be us-ing ‘Turing machine pseudocode’ (as in Lectures 49 and after) instead of trying to draw a transitiondiagram.
• Recall the L notation as it relates to regular expressions: for any regular expression R, we write L(R)to represent the set of strings matched by the regular expression R.The assignment questions start on the next page.
1. Let function D : {0, 1}∗ →Zbe defined by D(W )=#1(W )−#0(W ).
(a)(2 pts) Is D one-to-one? Prove that your answer is correct.
(b)(2 pts) Is D onto? Prove that your answer is correct.
2. Let function C : {0, 1}∗ →{0, 1}∗ be defined by C (W )=1 ·W .
(a)(2 pts) Is C one-to-one? Prove that your answer is correct.
(b)(2 pts) Is C onto? Prove that your answer is correct.
(c)(3 pts) Let L ={0, 1}∗, that is, the set of all binary strings. Prove that L is a countable set.
3.(5 pts) Let S ={f | f : {0, 1}∗ → {0, 1}∗}. In other words, S is the set consisting of all functions whose domain and range are binary strings. Use the Diagonal Method to prove that S is uncountable.
(Drawing a table can be a useful visual tool, but your submitted solution should not contain one.) Side note: We can conclude from this result that, even if we were able to write out every possible Java program that takes in a binary string and outputs a binary string, there are still infinitely many such functions out there that we cannot implement. This is because the number of different Java programs is countably infinite, yet this question proves that the number of functions is uncountably infinite!
4.(8 pts) Prove: for all languages L, language L is decidable if and only if L ≤m L(000∗(11 +111))
5.(7 pts) Prove that the following language is decidable HighStepsTM ={W ∈{0, 1}∗ |W =⟨T ⟩and T is a TM that: no matter which input X ∈{0, 1}∗ is given, machine T takes at least 420 steps} Clarification: “takes 1 step” means “follows 1 transition”
6.(8 pts) Prove that EqualTM is unrecognizable by choosing an appropriate language L and proving that L ≤m EqualTM.
7.(10 pts) In this question, we’ll consider a new kind of Turing machine, that I call an “American Turing Ma-chine”, or USTM. They are pretty much exactly the same as the Turing machines we’ve been using in this course (i.e., see Lectures 32-35), but with one difference: every state in the machine has a colour, Red or Blue.
Let L ={W ∈{0, 1}∗ |W =⟨T, c⟩where T is a USTM, c ∈{Red,Blue}, and:
there exists at least one binary input string X such that T executed on input X enters a state coloured c} Your task: Prove that L is undecidable.
COMP 3030 Automata Theory and Formal Languages
Answer in Detail
Solved by qualified expert
Get Access to This Answer
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Hac habitasse platea dictumst vestibulum rhoncus est pellentesque. Amet dictum sit amet justo donec enim diam vulputate ut. Neque convallis a cras semper auctor neque vitae. Elit at imperdiet dui accumsan. Nisl condimentum id venenatis a condimentum vitae sapien pellentesque. Imperdiet massa tincidunt nunc pulvinar sapien et ligula. Malesuada fames ac turpis egestas maecenas pharetra convallis posuere. Et ultrices neque ornare aenean euismod. Suscipit tellus mauris a diam maecenas sed enim. Potenti nullam ac tortor vitae purus faucibus ornare. Morbi tristique senectus et netus et malesuada. Morbi tristique senectus et netus et malesuada. Tellus pellentesque eu tincidunt tortor aliquam. Sit amet purus gravida quis blandit. Nec feugiat in fermentum posuere urna. Vel orci porta non pulvinar neque laoreet suspendisse interdum. Ultricies tristique nulla aliquet enim tortor at auctor urna. Orci sagittis eu volutpat odio facilisis mauris sit amet.
Tellus molestie nunc non blandit massa enim nec dui. Tellus molestie nunc non blandit massa enim nec dui. Ac tortor vitae purus faucibus ornare suspendisse sed nisi. Pharetra et ultrices neque ornare aenean euismod. Pretium viverra suspendisse potenti nullam ac tortor vitae. Morbi quis commodo odio aenean sed. At consectetur lorem donec massa sapien faucibus et. Nisi quis eleifend quam adipiscing vitae proin sagittis nisl rhoncus. Duis at tellus at urna condimentum mattis pellentesque. Vivamus at augue eget arcu dictum varius duis at. Justo donec enim diam vulputate ut. Blandit libero volutpat sed cras ornare arcu. Ac felis donec et odio pellentesque diam volutpat commodo. Convallis a cras semper auctor neque. Tempus iaculis urna id volutpat lacus. Tortor consequat id porta nibh.
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Hac habitasse platea dictumst vestibulum rhoncus est pellentesque. Amet dictum sit amet justo donec enim diam vulputate ut. Neque convallis a cras semper auctor neque vitae. Elit at imperdiet dui accumsan. Nisl condimentum id venenatis a condimentum vitae sapien pellentesque. Imperdiet massa tincidunt nunc pulvinar sapien et ligula. Malesuada fames ac turpis egestas maecenas pharetra convallis posuere. Et ultrices neque ornare aenean euismod. Suscipit tellus mauris a diam maecenas sed enim. Potenti nullam ac tortor vitae purus faucibus ornare. Morbi tristique senectus et netus et malesuada. Morbi tristique senectus et netus et malesuada. Tellus pellentesque eu tincidunt tortor aliquam. Sit amet purus gravida quis blandit. Nec feugiat in fermentum posuere urna. Vel orci porta non pulvinar neque laoreet suspendisse interdum. Ultricies tristique nulla aliquet enim tortor at auctor urna. Orci sagittis eu volutpat odio facilisis mauris sit amet.
Tellus molestie nunc non blandit massa enim nec dui. Tellus molestie nunc non blandit massa enim nec dui. Ac tortor vitae purus faucibus ornare suspendisse sed nisi. Pharetra et ultrices neque ornare aenean euismod. Pretium viverra suspendisse potenti nullam ac tortor vitae. Morbi quis commodo odio aenean sed. At consectetur lorem donec massa sapien faucibus et. Nisi quis eleifend quam adipiscing vitae proin sagittis nisl rhoncus. Duis at tellus at urna condimentum mattis pellentesque. Vivamus at augue eget arcu dictum varius duis at. Justo donec enim diam vulputate ut. Blandit libero volutpat sed cras ornare arcu. Ac felis donec et odio pellentesque diam volutpat commodo. Convallis a cras semper auctor neque. Tempus iaculis urna id volutpat lacus. Tortor consequat id porta nibh.
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Hac habitasse platea dictumst vestibulum rhoncus est pellentesque. Amet dictum sit amet justo donec enim diam vulputate ut. Neque convallis a cras semper auctor neque vitae. Elit at imperdiet dui accumsan. Nisl condimentum id venenatis a condimentum vitae sapien pellentesque. Imperdiet massa tincidunt nunc pulvinar sapien et ligula. Malesuada fames ac turpis egestas maecenas pharetra convallis posuere. Et ultrices neque ornare aenean euismod. Suscipit tellus mauris a diam maecenas sed enim. Potenti nullam ac tortor vitae purus faucibus ornare. Morbi tristique senectus et netus et malesuada. Morbi tristique senectus et netus et malesuada. Tellus pellentesque eu tincidunt tortor aliquam. Sit amet purus gravida quis blandit. Nec feugiat in fermentum posuere urna. Vel orci porta non pulvinar neque laoreet suspendisse interdum. Ultricies tristique nulla aliquet enim tortor at auctor urna. Orci sagittis eu volutpat odio facilisis mauris sit amet.
Tellus molestie nunc non blandit massa enim nec dui. Tellus molestie nunc non blandit massa enim nec dui. Ac tortor vitae purus faucibus ornare suspendisse sed nisi. Pharetra et ultrices neque ornare aenean euismod. Pretium viverra suspendisse potenti nullam ac tortor vitae. Morbi quis commodo odio aenean sed. At consectetur lorem donec massa sapien faucibus et. Nisi quis eleifend quam adipiscing vitae proin sagittis nisl rhoncus. Duis at tellus at urna condimentum mattis pellentesque. Vivamus at augue eget arcu dictum varius duis at. Justo donec enim diam vulputate ut. Blandit libero volutpat sed cras ornare arcu. Ac felis donec et odio pellentesque diam volutpat commodo. Convallis a cras semper auctor neque. Tempus iaculis urna id volutpat lacus. Tortor consequat id porta nibh.
12 More Pages to Come in This Document. Get access to the complete answer.
More COMP3030 COMP 3030 Automata Theory and Formal Languages: Questions & Answers
a. Explain in your own words the purpose of the command in the context of the assignment question. (Please do not just copy the “Description”section from the man page!) Also,you need to explain in your own words all terminology used—as if you were explaining to an average user! (Pl …
View Answer
Aligning IT With Business Objectives: A Critical Survival And Success Factor In Today’s Business …
View Answer
Tasks
Describe the functional and non-functional requirements of the application
Critically analyse and document the architecture of your application
for the integration and composition of cloud application services
Ensure that your application take advantage of suitable applic …
View Answer
2Bike entrancesThe entrances and their respective data labels are:EntanceLabelVesterbrogadeVBernstoffsgadeBIstegadeITietgensgadeTRequirements:Your task is to select and apply statistical analysis techniques to examine the data and derive some conclusions to the following questions:1.Are there differ …
View Answer
Content Removal Request
If you are the original writer of this content and no longer wish to have your work published on Myassignmenthelp.com then please raise the
content removal request.
Choose Our Best Expert to Help You
Caldwell Sutherland
I have completed my post graduation In Professional Accounting from The University In East London
150 – Completed Orders
Hire Me
Browne Monroe
I am an MA in Linguistics, and I have completed my post-graduation from the University of Leeds.
550 – Completed Orders
Hire Me
Still in Two Minds? The Proof is in Numbers!
33845 Genuine Reviews With a Rating of 4.9/5.
Assignment
Essay: 1 Page, Deadline:
19 days
Writer did a great job. Very informative and thorough. Very Impressive. Thank you.
User ID: 7***39 United States
Statistics
Programming: 2 Pages, Deadline:
1 hour
I am very Satisfied with the help I received. I Highly recommend them for any study help
User ID: 2***79 Pawtucket, United States
Management
Essay: 5 Pages, Deadline:
21 days
It is a good writing with reliable sources and meet the deadline earlier than I expected. Such a good job
User ID: 5***30 Canada
Mechanical Engineering
Home Work: 1 Page, Deadline:
27 days
Made a 69% but worked really hard! I think the option for 2 experts should be available.
User ID: 6***06 Atlanta, United States
Management
Essay: 6 Pages, Deadline:
6 days
excellent work done by the expert thank you really Appreciated it i am glad i trusted it
User ID: 4***83 London, Great Britain
English
Essay: 4 Pages, Deadline:
9 days
Very good paper, included everything and helpful. I got a grade on the essay, received a 100 on my paper. I highly recommend this website!
User ID: 6***89 United States
Marketing
Assignment: 10 Pages, Deadline:
11 days
Excellent job. Very timely. Customer service was top-notch. Even my lecturer was impressed.
User ID: 8***83 Canada
Management
Assignment: 7 Pages, Deadline:
9 days
I am very happy when I get marks I feel very verry good I got good marks thank u so much for helping me
User ID: 5***67 Canada
Project Management
Essay: 9 Pages, Deadline:
1 day
was a part of my programme management curs level 5 i passed it with 85% and that is soo good for me, thank you
User ID: 7***04 Birmingham, Great Britain
Management
Thesis: 1.8 Pages, Deadline:
6 days
Very good job I am very happy when I get marks I very very happy thank u so much for helping me
User ID: 5***67 Canada
Assignment
Essay: 1 Page, Deadline:
19 days
Writer did a great job. Very informative and thorough. Very Impressive. Thank you.
User ID: 7***39 United States
Statistics
Programming: 2 Pages, Deadline:
1 hour
I am very Satisfied with the help I received. I Highly recommend them for any study help
User ID: 2***79 Pawtucket, United States
Management
Essay: 5 Pages, Deadline:
21 days
It is a good writing with reliable sources and meet the deadline earlier than I expected. Such a good job
User ID: 5***30 Canada
Mechanical Engineering
Home Work: 1 Page, Deadline:
27 days
Made a 69% but worked really hard! I think the option for 2 experts should be available.
User ID: 6***06 Atlanta, United States
Management
Essay: 6 Pages, Deadline:
6 days
excellent work done by the expert thank you really Appreciated it i am glad i trusted it
User ID: 4***83 London, Great Britain
English
Essay: 4 Pages, Deadline:
9 days
Very good paper, included everything and helpful. I got a grade on the essay, received a 100 on my paper. I highly recommend this website!
User ID: 6***89 United States
Marketing
Assignment: 10 Pages, Deadline:
11 days
Excellent job. Very timely. Customer service was top-notch. Even my lecturer was impressed.
User ID: 8***83 Canada
Management
Assignment: 7 Pages, Deadline:
9 days
I am very happy when I get marks I feel very verry good I got good marks thank u so much for helping me
User ID: 5***67 Canada
Project Management
Essay: 9 Pages, Deadline:
1 day
was a part of my programme management curs level 5 i passed it with 85% and that is soo good for me, thank you
User ID: 7***04 Birmingham, Great Britain
Management
Thesis: 1.8 Pages, Deadline:
6 days
Very good job I am very happy when I get marks I very very happy thank u so much for helping me
User ID: 5***67 Canada