Programming languages sample final exam question 1 give a...

Name: programming languages sample final exam question 1 give a regular expression for each of the following languages over 0 1 9 1 all 5 digit integers that contain no leading zeros 2 all positiv 75969
Uploaded: 2023-12-05T22:05:05-08:00
Duration: 2 min 49 s
Channel: Akash M
Description: programming languages sample final exam question 1 give a regular expression for each of the following languages over 0 1 9 1 all 5 digit integers that contain no leading zeros 2 all positiv 75969

Programming Languages Sample Final Exam Question 1 Give a regular expression for each of the following languages over Σ = {0, 1, . . . , 9}. 1. All 5-digit integers that contain no leading zeros. 2. All positive integers that begin with 9 and that are multiples of 5. 3. All strings that begin with 9 and contain three consecutive 1s. Question 2 Give a DFA for each of the languages in Question 1.

35 points: 10 points for each of a-c. 5 points for d. The language of strings over the alphabet = {0,1} which, in binary, represent even numbers, is a regular language. Show this by giving both (a) a regular expression and (b) drawing a finite state automaton (FSA) that recognizes strings from this language. Since regular languages are also context-free, give (c) a context-free grammar for this language. Finally, is the language of binary strings which represent odd numbers a regular language? If so, show why this is without resorting to regular expressions or FSAs. Note: You need not worry about leading zeros in any of the above. For example, 1010, 01010, 001010, and 0001010 all represent the number ten and are even. The regular expression (a) or context-free grammar (c) may generate strings with leading zeros (which represent only even numbers, of course), and the FSA (b) may recognize such strings.

Akash M.

Question

Please give Ace some feedback