Lecture 10.pptx

# Lecture 10.pptx - Automata Theory Lecture 10 Recap Removing...

• Notes
• 7

This preview shows page 1 - 7 out of 7 pages.

Automata Theory Lecture 10

Subscribe to view the full document.

Recap Removing Nondeterminism from NFA because of multiple edges NFA-^ to NFA to FA Kleene’s theorem – Part 1 – RL to FA Two ways to construct FA
Kleene’s theorem – Part 2 Statement If M is FA then L(M) is regular language

Subscribe to view the full document.

Proof Important points States in Q are numbered from 1 to n where n is total number of states. L(p, q, j) = Is a set of strings causing to move from p to q without going through a state numbered higher than j. Basic step: L(p, q, 0) is regular and covers and ^. Induction hypothesis: Assume L(p, q, k) is regular and prove L(p, q, k+1) is regular too.
Proof To prove L(p, q, k+1) is regular there are two possibilities.

Subscribe to view the full document.

You've reached the end of this preview.
• Fall '15
• Aftab

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern