# day33 - 10/4/11 Dec 2, UCF (Charles E. 11 Some Known...

This preview shows pages 1–5. Sign up to view the full content.

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 10/4/11 Dec 2, UCF (Charles E. 11 Some Known Results Regular languages, A and B A A k ] B is regular, for all k>0 A B is regular A &* B is not necessarily regular Deciding whether or not A an open problem 10/4/11 Dec 2, UCF (Charles E. 22 More Known Stuff CFLs, A and B A V B is a CFL A V B is a CFL A [ k ] B is not necessarily a CFL, for k>1 Consider A=anbn; B = cmdm and k=2 Trick is to consider (A Q [ 2 ] B) B a*c*b*d* A & B is not necessarily a CFL A &* B is not necessarily a CFL 10/4/11 Dec 2, UCF (Charles E. 33 Immediate Convergence L = L2 ? L = L & L ? L = L & L ? L = L & * L ? L = L & c L ? L = L & u L ? 10/4/11 Dec 2, UCF (Charles E. 44 Finite Convergence 1k>0 Lk = Lk+1 1k&0 L (k) L = L (k+1) Q L 1k&0 L & [ k ] L = L c [ k+1 ] L 1kB 0 L & k L = L & k +1 L 1k&0 L (k) 1k&0 L (k) 1k&0 A (k) 1k&0 A & [ k ] B = A c [ k+1 ] B 1km 0 A & k B = A & k +1 B 10/4/11...
View Full Document

## This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.

### Page1 / 10

day33 - 10/4/11 Dec 2, UCF (Charles E. 11 Some Known...

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

View Full Document
Ask a homework question - tutors are online