lect19 - Summary A language L is a set of strings over some...

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

View Full Document Right Arrow Icon
1 Summary . A language L is a set of strings over some alphabet Σ . To describe a regular language we can use: set operations regular expressions DFA that recognizes the language. Any of this specification must be unambiguous (but may be not unique) A language can be regular if it satisfies some restrictions. Set notations can be used to specify what strings belong to language.
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 Example. Find the DFA to recognize the language L , which consists of all strings over the alphabet Σ = { a , b }, L { a , b } * that include a substring aba . Set notation: L = { a , b } * { aba } { a , b } * Regular expression: ( a + b ) * aba ( a + b ) * q 0 b q 1 a q 2 b b q 3 a a , b a DFA
Background image of page 2
3 Transition function δ : Q × Σ Q δ ( q 0 , a )= q 1 δ ( q 0 , b )= q 0 δ ( q 1 , a )= q 1 δ ( q 1 , b )= q 2 δ ( q 2 , a )= q 3 δ ( q 2 , b )= q 0 δ ( q 3 , a )= q 3 δ ( q 3 , b )= q 3 Configurations for the input string w = aaaabab ( q 0 , aaaabab ) ( q 1 , aaabab ) ( q 1 , aabab ) ( q 1 , abab ) ( q 1 , bab ) ( q 2 , ab ) ( q 3 , b ) ( q 3 , λ ) Q = { q 0 , q 1 , q 2 , q 3 } Σ ={ a , b } q 0 b q 1 a q 2 b b q 3 a a , b a accepting state start state aaaabab L
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 What language L { a , b } * is recognized by the following DFA? Give regular expression describing the language. 0 a a , b a b b b 1 2 3 a L = λ + aa * b + aa * baa * b + aa * baa * baa * b +… = λ + aa * b + ( aa * b ) 2 + ( aa * b ) 3 +… = ( aa * b ) * L is the set of strings over { a , b } for which each occurrence of b is preceded by at least one a and the only string with no b ’s is λ .
Background image of page 4
5 Inductive proofs on strings. Usually induction is done on the length of a string | w | =n , or the number of repetition of some pattern. Prove that the regular expression
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 / 16

lect19 - Summary A language L is a set of strings over some...

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