CENG304Homework4

CENG304Homework4 - Fatih University Department of Computer...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Fatih University Department of Computer Engineering CENG 304 Automata Theory and Formal  Languages Assignment 4 Ahmet Faruk Bişkinler, 07010441 21 May 2007
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
h    ttp://www.biskinler.com     http://ahmet.piskinler.com/ 3.1.4. Find a regular expression for {a n b m : (n + m) is even}. n + m is even in only two cases: when both n and m are even, or when both are odd.  Therefore the  expression (aa)*(bb)* + a(aa)*b(bb)* would represent this language. 3.1.5. Give a regular expression for each of the following a. L 1  = { a n b m n    4,  m    3} ( aaaa ) a *( λ + b + bb + bbb ) b. L 2  = { a n b m n  < 4,  m    3} ( λ + a + aa + aaa ) ( λ + b + bb + bbb ) c. The complement of  L 1 n  < 4 or  m  > 3 or not in the proper form: an  a  can follow a  b . ( λ + a + aa + aaa ) b * +  a *( bbbb ) b * + ( a + b )* ba ( a + b )* d. The complement of  L 2 n    4 or 
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

CENG304Homework4 - Fatih University Department of Computer...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online