A characterization of words of linear complexity
Work
Year: 2018
Type: article
Abstract: Given an infinite word $x=x_0x_1x_2\cdots \in \mathbb {A}^\mathbb {N}$ over some finite alphabet $\mathbb {A},$ the factor complexity $p_x(n)$ counts the number of distinct factors of $x$ of each give... more
Institutions Château Gombert, Institut Polytechnique de Bordeaux, Institut de Mathématiques de Marseille, Laboratoire de Chimie Théorique
Cites: 17
Cited by: 3
Related to: 10
FWCI:
Citation percentile (by year/subfield): 58.12
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Grant ID 18-31-00118