diff -r f947fe289db8 Doc/library/collections.rst
--- a/Doc/library/collections.rst	Thu Nov 21 22:33:21 2013 +0100
+++ b/Doc/library/collections.rst	Sun Dec 08 20:32:36 2013 -0800
@@ -268,9 +268,9 @@
     .. method:: most_common([n])
 
         Return a list of the *n* most common elements and their counts from the
-        most common to the least.  If *n* is not specified, :func:`most_common`
-        returns *all* elements in the counter.  Elements with equal counts are
-        ordered arbitrarily:
+        most common to the least.  If *n* is not specified or is ``None``, 
+        :func:`most_common` returns *all* elements in the counter.  Elements 
+        with equal counts are ordered arbitrarily:
 
             >>> Counter('abracadabra').most_common(3)
             [('a', 5), ('r', 2), ('b', 2)]
@@ -411,7 +411,7 @@
     position of the underlying data representation.
 
 
-    If *maxlen* is not specified or is *None*, deques may grow to an
+    If *maxlen* is not specified or is ``None``, deques may grow to an
     arbitrary length.  Otherwise, the deque is bounded to the specified maximum
     length.  Once a bounded length deque is full, when new items are added, a
     corresponding number of items are discarded from the opposite end.  Bounded
@@ -493,7 +493,7 @@
 
     .. attribute:: maxlen
 
-        Maximum size of a deque or *None* if unbounded.
+        Maximum size of a deque or ``None`` if unbounded.
 
         .. versionadded:: 3.1