1 The Foundations: Logic And Proofs 2 Basic Structures: Sets, Functions, Sequences, Sums, And Matrices 3 Algorithms 4 Number Theory And Cryptography 5 Induction And Recursion 6 Counting 7 Discrete Probability 8 Advanced Counting Techniques 9 Relations 10 Graphs 11 Trees 12 Boolean Algebra 13 Modeling Computation A Appendices expand_more
13.1 Languages And Grammars 13.2 Finite-state Machines With Output 13.3 Finite-state Machines With No Output 13.4 Language Recognition 13.5 Turing Machines Chapter Questions expand_more
Problem 1E: Exercises 1-3 refer to the grammar with start symbol sentence, set of terminals T = {the, sleepy,... Problem 2E: Exercises 1-3 refer to the grammar with start symbol sentence, set of terminals T = {the, sleepy,... Problem 3E Problem 4E: Let G=(V,T,S,P) be the phrase-structure grammar with V={0,1,A,S},T={0,1} , and set of production P... Problem 5E Problem 6E Problem 7E Problem 8E: Show that the grammar given in Example 5 generates the set {0n1nn=0,1,2,...} . Problem 9E Problem 10E Problem 11E: Construct a derivation of 021222 in the grammar given in Example 7. Problem 12E: Show that the grammar given in Example 7 generates the set {0n1n2nn=0,1,2,...} . Problem 13E: s13. Find a phrase-structure grammar for each of these languages. a) the set consisting of the bit... Problem 14E: Find a phrase-structure grammar for each of these languages. a) the set consisting of the bit... Problem 15E: Find a phrase-structure grammar for each of these languages. a) the set of all bit strings... Problem 16E: Construct phrase-structure grammars to generate each of these sets. a) {1n|n0} b) {10n|n0} c)... Problem 17E: Construct phrase-structure grammars to generate each of these sets. a) {0n|n0} b) {1n0|n0} c)... Problem 18E: Construct phrase-structure grammars to generate each of these sets. a) {012n|n0} b) {0n12n|n0} c)... Problem 19E Problem 20E: A palindrome is a string that reads the same backward as it does forward, that is, a string w ,... Problem 21E: Let G1 and G2 be context-free grammars, generating the languages L(G1) and L(G2) respectively. Show... Problem 22E Problem 23E: Construct derivation trees for the sentences in Exercise 1. 1. Use the set of productions to show... Problem 24E: Let G be the grammar with V={a,b,c,S};T={a,b,c} ; starting symbol S; and productions... Problem 25E Problem 26E Problem 27E Problem 28E: a) Explain what the productions are in a grammar if the BackusNaur form for productions is as... Problem 29E Problem 30E: a) Construct a phrasestructure grammar for the set of all fractions of the form a/b, where a is a... Problem 31E: Give production rules in Backus-Naur form for an identifier if it can consist of a) one or more... Problem 32E Problem 33E Problem 34E Problem 35E Problem 36E Problem 37E Problem 38E Problem 39E Problem 40E Problem 41E Problem 42E: Let G be a grammar and let R be the relation containing the order pair (w0,w1) if and only if w1 is... format_list_bulleted