Ask
Login
1
16kviews
Define Chomsky normal form. Simplify following CFG and convert it into CNF. S-->ASB/e, A-->aAS/a, B-->SbS/A/bb
written 3.8 years ago by gravatar for nehetiw974 nehetiw974 • 30 modified 3.8 years ago by gravatar for binitamayekar binitamayekar ★ 6.7k

Where e is null.
automata theory
ADD COMMENT EDIT

Answer for Define Chomsky Normal Form

3.8 years ago by prakhar1144 ★ 5.0k
1 Answer
4
1.2kviews
written 3.8 years ago by gravatar for binitamayekar binitamayekar ★ 6.7k •   modified 3.8 years ago

Context-Free Grammar (CFG)

  • A Context-Free Grammar (CFG) is one form of grammar that is used to generate all possible patterns of strings in a given formal language.
  • In CFG at the Right Hand Side (RHS) of production, there may be any number of Terminals (a, b, c, etc.) and Non-Terminals …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.