CS 475 Midterm: CS 475 Alabama Fall2017 Exam4 3Solutions

22 views3 pages
31 Jan 2019
Department
Course
Professor

Document Summary

You may choose any set of problems that adds up to 100 or more points: write all the strings of lengths 2 and 4 that are accepted by this turing machine. X/x, l a/x, l b/x, l d/x, l c/x, l c/c, l d/d, l da cb ddaa cdab dcba ccbb. B/b, r dada cbda dacb cbcb: write the 10 shortest positive lengths of the non-empty strings that can be generated by this unrestricted grammar. The terminal alphabet is just {a}, so it is sufficient to write just the lengths rather than the entire strings. [20 points for cs 475] [10 points for cs 575] Also write a precise simple definition of the language l that is generated by the above unrestricted grammar. L = { an | n is divisible by 12 or 15 or 20 } For problems 3 and 4, let language l1 = { am bn | n is a multiple of m }.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions