acm-header
Sign In

Communications of the ACM

Blogroll


Refine your search:
datePast Week
authorgasarch
bg-corner

From Computational Complexity

CFG-Kolm-complexity is singleton sets with Lance and Bill

For this post all Context Free Grammars (henceforth CFGs) are assumed to be in Chomsky Normal Form. The size of a CFG \(G\)  is the number of rules. We denote this...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account