hw2J2009

hw2J2009 - A such that L( A ) = L. In case (b), build a PDA...

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

View Full Document Right Arrow Icon
CS 181 Homework 2 Regular and context-free languages Due Friday, July 31, 2009 1. Minimize: 0,1 0 0 0,1 0 1 1 1 0 0 1 1 0,1 0,1 2. L = { a n b m c 2( n + m ) ; n 0, m 0 } Find if L is a) a regular language; b) a context-free language. In case (a), build a finite automaton
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A such that L( A ) = L. In case (b), build a PDA D and a formal grammar G such that L( D ) = L(G) = L. 3. Is any finite language regular? Prove that your answer is correct....
View Full Document

Ask a homework question - tutors are online