Module22 - Module 22 Regular languages are a subset of LFSA...

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

View Full Document Right Arrow Icon
1 Module 22 Regular languages are a subset of LFSA algorithm for converting any regular expression into an equivalent NFA Builds on existing algorithms described in previous lectures
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Regular languages are a subset of LFSA
Background image of page 2
3 Reg. Lang. subset LFSA Let L be an arbitrary Let R be the R exists by definition of Construct an M is constructed from Argue There exists an L is in By definition of
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Visualization Regular Languages LFSA Regular Expressions NFA- λ ’s L L R M
Background image of page 4
5 Algorithm Specification Input Regular expression R Output NFA M such that L(M) = Regular expression R NFA- λ M A
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 Recursive Algorithm We have an inductive definition for regular languages and regular expressions Our algorithm for converting any regular expression into an equivalent NFA is recursive in nature Base Case Recursive or inductive Case
Background image of page 6
7 Base Case Regular expression R has zero operators No concatenation, union, Kleene closure
Background image of page 7

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

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.

Page1 / 16

Module22 - Module 22 Regular languages are a subset of LFSA...

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

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