90.2K

Verified Solution

Link Copied!

pls answer question 2 , thank u!

sorry here are the slides for #7

in Tuesdays class to design a TM that accepts the following language: All strings w of cs and d such that reversing wand replacing each with d and each d with c again gives w(eg. ccdcd, cccddd). 2. (b) Use the implementation-level description from #7 in Tuesday's class to design a TM that accepts the following language: All string of cs and d's with the same total number of c's and d's, and in which each prefix has at least as many cas d's. inted Implementation-Level Descriptions 7. All strings of c's and d's with the same total number of c's and d's, and in which each prefix has at least as many c's as d's. 1. Find the first unmarked letter. 1.a If it is not c, then reject. 1.b If no unmarked letters remain, then accept. 1.c Mark the first letter. CMSC 203 - Theory of Computation 10 Implementation Level Descriptions Implementation-Level Descriptions 7. All strings of c's and d's with the same total number of c's and d's, and in which each prefix has at least as many c's as d's. 1. Find the first unmarked letter. 1.a If it is not c, then reject. 1.b If no unmarked letters remain, then accept. 1.c Mark the first letter. 2. Find the first umarked d. 2.a If no unmarked d remains, reject. 2.b Otherwise, mark the d and go to 1. in Tuesdays class to design a TM that accepts the following language: All strings w of cs and d such that reversing wand replacing each with d and each d with c again gives w(eg. ccdcd, cccddd). 2. (b) Use the implementation-level description from #7 in Tuesday's class to design a TM that accepts the following language: All string of cs and d's with the same total number of c's and d's, and in which each prefix has at least as many cas d's. inted Implementation-Level Descriptions 7. All strings of c's and d's with the same total number of c's and d's, and in which each prefix has at least as many c's as d's. 1. Find the first unmarked letter. 1.a If it is not c, then reject. 1.b If no unmarked letters remain, then accept. 1.c Mark the first letter. CMSC 203 - Theory of Computation 10 Implementation Level Descriptions Implementation-Level Descriptions 7. All strings of c's and d's with the same total number of c's and d's, and in which each prefix has at least as many c's as d's. 1. Find the first unmarked letter. 1.a If it is not c, then reject. 1.b If no unmarked letters remain, then accept. 1.c Mark the first letter. 2. Find the first umarked d. 2.a If no unmarked d remains, reject. 2.b Otherwise, mark the d and go to 1

Answer & Explanation Solved by verified expert

See Answer