#12231: factor complexity of substitutive languages
-----------------------------+----------------------------------------------
Reporter: sstarosta | Owner: sstarosta
Type: enhancement | Status: new
Priority: minor | Milestone: sage-4.8
Component: combinatorics | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies: #12227
-----------------------------+----------------------------------------------
Calculate factor complexity of a substutitive language (see #12227).
Factor complexity counts the number of factors of length n.
An effective way using families of bispecial factors and formula of
(Cassaigne Julien. Complexité et facteurs spéciaux [Complexity and special
factors]. Journées Montoises (Mons, 1994). Bull. Belg. Math. Soc. Simon
Stevin 4, no. 1, 67--88, 1997) can be used. In some cases, a closed
formula may be also found using this method.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12231>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
