recognizable series (a base for k-regular sequences)

[dkrenn]

Implement recognizable series, which are formal series, whose coefficients (each belongs to a word over an alphabet) satisfy a certain linear representation. (This linear representation is based on a monoid morphism into matrices.)

See also meta ticket #21202.

Depends on #30551

CC: @galipnik

Component: combinatorics

Keywords: thursdaysbdx

Author: Daniel Krenn

Branch/Commit: 42606e3

Reviewer: Sébastien Labbé, Clemens Heuberger

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

[dkrenn]

Branch: u/dkrenn/sequences/recognizable

[sagetrac-git]

Commit: fd4f541

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

fd4f541

move "transpose" in docstring to correct place

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

863d57a	remove None-sense to simplify code
aec95ce	extend element constructor
9e12383	add experimental warning

[sagetrac-git]

Changed commit from fd4f541 to 9e12383

[sagetrac-git]

Changed commit from 9e12383 to 41874ba

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

41874ba

fix a typo

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

c7243a6

Merge tag '7.4.beta1' into t/21295/sequences/recognizable