Skip to content

Add a class for factor-enumerable words #8604

@seblabbe

Description

@seblabbe

Add a class for factor-enumerable words, i.e. having an algorithm that enumerates the factor of length n which includes finite words and some family of infinite words. The new file gathers methods (e.g. rauzy_graph) that depends only on the existence of such an algorithm.

It also adds some method about left,right and bi special words:

    sage: f = words.FibonacciWord()[:30]
    sage: f.number_of_left_special_factors(7)
    8

The new class Word_nfactor_enumerable inherits from the abstract Word_class and FiniteWord_class now inherits from this Word_nfactor_enumerable class. Later, inifinite words having a such an algorithm will inherit also from this new class (in some other ticket).

CC: @sagetrac-abmasse @sagetrac-jleroy

Component: combinatorics

Keywords: Words, factors, enumeration

Author: Sébastien Labbé

Reviewer: Alexandre Blondin Massé

Merged: sage-4.5.2.alpha0

Issue created by migration from https://trac.sagemath.org/ticket/8604

Metadata

Metadata

Assignees

Type

No type

Projects

No projects

Milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions