pumping Lemma - S tandard Re se pre ntations of Re gular...

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

View Full Document Right Arrow Icon
Fall 2004-2005 CSI 301 1 Standard Representations of Regular Languages Regular Languages DFAs NFAs Regular Expressions Grammars
Background image of page 1

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

View Full DocumentRight Arrow Icon
Fall 2004-2005 CSI 301 2 When we say: We are given a Regular Language We mean: L Language is in a standard representation L
Background image of page 2
Fall 2004-2005 CSI 301 3 Elementary Questions about Regular Languages
Background image of page 3

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

View Full DocumentRight Arrow Icon
Fall 2004-2005 CSI 301 4 Membership Question Question: Given regular language and string how can we check if ? L L w w Answer: Take the DFA that accepts and check if is accepted L w
Background image of page 4
CSI 301 5 DFA L w L w w w
Background image of page 5

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

View Full DocumentRight Arrow Icon
Fall 2004-2005 CSI 301 6 Given regular language how can we check if is empty: ? L L Take the DFA that accepts Check if there is any path from the initial state to a final state L ) ( = L Question: Answer:
Background image of page 6
CSI 301 7 DFA L = L
Background image of page 7

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

View Full DocumentRight Arrow Icon
Fall 2004-2005 CSI 301 8 Given regular language how can we check if is finite? L L Take the DFA that accepts Check if there is a walk with cycle from the initial state to a final state L Question: Answer:
Background image of page 8
Fall 2004-2005 CSI 301 9 DFA L is infinite L is finite
Background image of page 9

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

View Full DocumentRight Arrow Icon
Fall 2004-2005 CSI 301 10 Given regular languages and how can we check if ? 1 L 2 L 2 1 L L = Question: = ) ( ) ( 2 1 2 1 L L L L Find if Answer:
Background image of page 10
Fall 2004-2005 CSI 301 11 = ) ( ) ( 2 1 2 1 L L L L = 2 1 L L = 2 1 L L and 2 1 L L = 1 L 2 L 1 L 2 L 2 1 L L 1 2 L L 2 L 1 L
Background image of page 11

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

View Full DocumentRight Arrow Icon
Fall 2004-2005 CSI 301 12
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/25/2011 for the course CSI 301 taught by Professor Mr.elienasr during the Spring '10 term at American University of Science & Tech.

Page1 / 51

pumping Lemma - S tandard Re se pre ntations of Re gular...

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

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