Module23 - Module 23 Regular languages review Several ways...

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

View Full Document Right Arrow Icon
1 Module 23 Regular languages review Several ways to define regular languages Two main types of proofs/algorithms Relative power of two computational models proofs/ constructions Closure property proofs/constructions Language class hierarchy
Background image of page 1

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

View Full Document Right Arrow Icon
2 Defining regular languages
Background image of page 2
3 Three definitions LFSA A language L is in LFSA iff there exists an FSA M s.t. L(M) = L LNFA A language L is in LNFA iff there exists an NFA M s.t. L(M) = L Regular languages A language L is regular iff there exists a regular expression R s.t. L(R) = L Conclusion All these language classes are equivalent Any language which can be represented using any one of these models can be represented using either of the other two models
Background image of page 3

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

View Full Document Right Arrow Icon
4 Two types of proofs/constructions
Background image of page 4
5 Relative power proofs These proofs work between two language classes and two computational models The crux of these proofs are algorithms which behave as follows: Input: One program from the first computational model
Background image of page 5

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

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 9

Module23 - Module 23 Regular languages review Several ways...

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

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