In formal language theory, a context-free grammar G is said to be in Chomsky normal form  if$$ S  A B$$$$ A  a $$$$S   $$My question is that if $B$ in the the form of$$ B  abcd $$where $abcd$ are terminal symbol, is this still in Chomsky Normal Form? ?
Can Chomsky Normal Form have more than one terminal?
formal languages;context free;automata
The above given CFG cannot be in Chomsky Normal Form since the production Babcd has multiple terminals on left hand side of the production.In order to convert the given CFG to Chomsky Normal Form, will need to replace the terminals on lhs of production Babcd as follows - B->abcdB->FGF->AEG->CDE->bC->cD->d.