flac-hw3 - does not exist such an DFA that recognizes the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
FLAC Assignment 3 Exercise 1 For each of the following regular expressions, construct a DFA that recognizes it. 1. ((0 1) * 0) * 2. (1010 0101 10 01) * 3. 0 (00 000) * Exercise 2 We write each natural number 1 in its binary representation; e.g., “5” is represented as 101 and “9” is represented as 1001. Give a regular expression for the following language: L = { x | x is the binary representation of some natural number divisible by 3 } . Exercise 3. DFA Minimization. Given the following DFA of which A is the start state and D is the accept state, find the smallest equivalent DF A. 0 1 A B A B A C C D B *D D A E D F F G E G F G H G D Exercise 4: No DFA for Prime. In this problem, you are asked to prove that there
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: does not exist such an DFA that recognizes the language of all prime numbers in binary representation. For example, the DFA will accept, 10, 11, 101, 111 and reject 1, 100, 1001. 1. (step 1) Prove that if such a DFA M exists for prime numbers, then there is a infinite sequence of prime numbers a ,a 1 ,...a n ,... with the recursive form that a i +1 = ua i + v for some fixed integer u > 1 and v depending on M. 2. (step 2 (bonus)) Show that for such a sequence, some a i ( i > 0) in a 1 ,a 2 ,..a a must be divisible by a . 1 Zero is a natural number Page 1...
View Full Document

This note was uploaded on 02/29/2012 for the course CS 15-453 taught by Professor Edmundm.clarke during the Spring '09 term at Carnegie Mellon.

Ask a homework question - tutors are online