Ask
Login
0
5.8kviews
Explain with an example Chomsky Normal Form
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 5.0 years ago
theory of computation
ADD COMMENT EDIT
1 Answer
0
116views
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k

  • A context-free grammar G = (V, Σ, R, S) is said to be in Chomsky Normal Form (CNF), if and only if every rule in R is of one of the following forms:

    1. A → a, for some A ∈ V and some a ∈ Σ
    2. A → BC, for …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.