Weak generative capacity
From Wikipedia, the free encyclopedia
Weak generative capacity refers to the set of strings (also called languages) that can be generated by a grammar.[1] All grammars of a given formal complexity can generate the same strings.
[edit] See also
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
