This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a) pref ( L ) = { w : 5 x ∈ Σ * ( wx ∈ L )}. b) suff ( L ) = { w : 5 x ∈ Σ * ( xw ∈ L )}. c) reverse(L) = { x ∈ Σ * : x = w R for some w ∈ L }. d) letter substitution (as defined in Section 8.3). 7) Using the definitions of maxstring and mix given in Section 8.6, give a precise definition of each of the following languages: a) maxstring (A n B n ). b) maxstring ( a i b j c k , 1 ≤ k ≤ j ≤ i ). c) maxstring ( L 1 L 2 ), where L 1 = { w ∈ { a , b }* : w contains exactly one a } and L 2 = { a }. d) mix (( aba )*). e) mix ( a * b *)....
View
Full Document
 Fall '08
 Rich
 Formal language, Regular expression, following languages, Elaine Rich Homework

Click to edit the document details