#19159: Check if a word is a Christoffel word.
-------------------------------------+-------------------------------------
Reporter: mlapointe | Owner: mlapointe
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: words, | Merged in:
Christoffel, days69 | Reviewers: Nadia Lafrenière
Authors: Mélodie Lapointe | Work issues:
Report Upstream: N/A | Commit:
Branch: | e3c4697ae3a68c2bdb0bee389aa8f1b39fc371bc
u/mlapointe/check_if_a_word_is_a_christoffel_word_| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by egunawan):
Also, you need to write the following format for the hyperlinks to work:
`` REFERENCES:
.. [1] Jean Berstel. Sturmian and episturmian words (a survey of
some recent results). In S. Bozapalidis and G. Rahonis,
editors,
CAI 2007,volume 4728 of Lecture Notes in Computer Science,
pages 23-47. Springer-Verlag, 2007.
.. [2] J. Berstel, A. Lauve, C. R., F. Saliola, Combinatorics on
words: Christoffel words and repetitions in words, CRM
Monograph
Series, 27. American Mathematical Society, Providence, RI,
2009.
xii+147 pp. ISBN: 978-0-8218-4480-9``
--
Ticket URL: <http://trac.sagemath.org/ticket/19159#comment:17>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
