This page is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
A simple example showing the theorem's use would be helpful. Virgil H. Soule (talk) 15:13, 17 July 2014 (UTC)
I have added an example explaining how the theorem about counting words can be used to prove that certain context-free languages do not admit an unambiguous grammar. The theorem can be of course used in many ways, so more examples are welcome. Hermel (talk) 12:39, 18 July 2014 (UTC)
I have added another example explaining how the theorem about counting words can be used for asymptotic estimates. Hermel (talk) 20:55, 31 July 2014 (UTC)