Skip to content

Commit d7d5bc1

Browse files
Fix docs typos
Co-authored-by: Codex <codex@openai.com>
1 parent 2a64384 commit d7d5bc1

File tree

5 files changed

+6
-6
lines changed

5 files changed

+6
-6
lines changed

docs/source/changelog-v1.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ version 3 of libsemigroups_. The extent of the changes made in this release
8282
means that it is likely that any code written with earlier versions of
8383
``libsemigroups_pybin11`` will no longer work.
8484

85-
The structure of ``libsemigroups_pybind11`` is very tightly linked to the the
85+
The structure of ``libsemigroups_pybind11`` is very tightly linked to the
8686
structure of libsemigroups_. Therefore, some of the differences between
8787
v0.10.1 and v1.0.0 of ``libsemigroups_pyind11`` will be related to the
8888
differences between v2 and v3 of libsemigroups_, such as changes to class names

docs/source/data-structures/presentations/to-inverse-present.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -113,7 +113,7 @@ the type of words specified in *rtype*:
113113
objects of type :any:`InversePresentation` must be converted from one
114114
type to another sometimes, but not other times.
115115

116-
If the alphabet of of *ip* is :math:`\{a_0, a_1, \dots a_{n-1}\}`, where each
116+
If the alphabet of *ip* is :math:`\{a_0, a_1, \dots a_{n-1}\}`, where each
117117
letter is of type ``str``, then the conversion from one type to another is
118118
:math:`a_i \mapsto` ``human_readable_index(a_i)``. Conversely, if each letter is
119119
of type ``list[int]``, then the conversion from one type to another is

docs/source/data-structures/presentations/to-present.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -66,7 +66,7 @@ the type of words specified in *rtype*:
6666
presentations must be converted from one type to another sometimes, but
6767
not other times.
6868

69-
If the alphabet of of *p* is :math:`\{a_0, a_1, \dots a_{n-1}\}`, where each
69+
If the alphabet of *p* is :math:`\{a_0, a_1, \dots a_{n-1}\}`, where each
7070
letter is of type ``str``, then the conversion from one type to another is
7171
:math:`a_i \mapsto` ``human_readable_index(a_i)``. Conversely, if each letter is
7272
of type ``list[int]``, then the conversion from one type to another is

docs/source/main-algorithms/froidure-pin/to-froidure-pin.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -101,7 +101,7 @@ This function throws a :any:`LibsemigroupsError` if the
101101
.. warning::
102102

103103
The returned :any:`FroidurePin` instance is always infinite, and so any
104-
calls to any member functions that that trigger a full enumeration will
104+
calls to any member functions that trigger a full enumeration will
105105
never terminate (or they will when your computer kills the process because
106106
it has run out of memory).
107107

docs/source/main-algorithms/knuth-bendix/to-knuth-bendix.rst

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -100,9 +100,9 @@ following values for *args*:
100100
Additionally, specify one of the following for *rtype*:
101101

102102
- ``(KnuthBendix, 'RewriteTrie')`` for constructing a :any:`KnuthBendix`
103-
with the the ``RewriteTrie'`` rewriter.
103+
with the ``RewriteTrie'`` rewriter.
104104
- ``(KnuthBendix, 'RewriteFromLeft')`` for constructing a :any:`KnuthBendix`
105-
with the the ``RewriteFromLeft'`` rewriter.
105+
with the ``RewriteFromLeft'`` rewriter.
106106

107107
This function converts a :any:`ToddCoxeter` object *tc* to a :any:`KnuthBendix`
108108
object with the rewriter as specified above, using

0 commit comments

Comments
 (0)