This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: T of a relation R , given the relation R as a matrix. 5. (a) A Chomsky Normal Form grammar G is of the form G = (Σ ,V,S,δ ), where Σ is the alphabet set, V is a set of nontermimals (where V ∩ Σ = ∅ ), S ∈ V is a starting symbol and δ is a set of productions of the form: A → BC or A → a , where A,B,C ∈ V and a ∈ Σ is a terminal. In the following α,β,γ,w are strings in (Σ ∪ V ) * . 1 (b) We say that αAβ ⇒ G αwβ , where A → w is a production in G (that is member of δ ). (c) We say that α ⇒ * G β if one of the following holds: (i) α = β , (ii) α ⇒ G β or (iii) for some γ , α ⇒ G γ and γ ⇒ * G β . (d) We say that L ( G ) = { w : w ∈ Σ * and S ⇒ * G w } . Given a Chomsky Normal Form grammar G , give a dynamic programming algorithm to determine if a string w ∈ Σ * is a member of L ( G ). 2...
View
Full
Document
 Fall '10
 sanjay
 Algorithms

Click to edit the document details