Smallest grammar problem
Encyclopedia
The smallest grammar problem is the problem of finding the smallest formal grammar
which encodes for a unique string of characters. The size of a grammar is defined by the number of symbols on the right side of the production rules.
Formal grammar
A formal grammar is a set of formation rules for strings in a formal language. The rules describe how to form strings from the language's alphabet that are valid according to the language's syntax...
which encodes for a unique string of characters. The size of a grammar is defined by the number of symbols on the right side of the production rules.