Finite repetition threshold for large alphabets

Author： Badkobeh Golnaz   Crochemore Maxime   Rao Michaël  

Publisher： Edp Sciences

E-ISSN： 1290-385x|48|4|419-430

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.48, Iss.4, 2014-10, pp. : 419-430

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On Abelian repetition threshold

By Samsonov Alexey V.   Shur Arseny M.  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 1, 2012-03 ,pp. : 147-163

Edp Sciences

Access to resources Recommend Favorite

On the D0L Repetition Threshold

By Goldstein Ilya  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 3, 2010-10 ,pp. : 281-292

Edp Sciences

Access to resources Recommend Favorite

Sturmian jungle (or garden?) on multiliteral alphabets

By Balková L'ubomíra   Pelantová Edita   Starosta Štěpán  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 4, 2011-02 ,pp. : 443-470

Edp Sciences

Access to resources Recommend Favorite

The finite element treatment of large size coupled problems using unequal meshes

By Coyette Jean-Pierre   Dubois-Pelerin Yves   Migeot Jean-Louis  

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 1994, Iss. 2, 1994-09 ,pp. : 2003-2006

Institute of Noise Control Engineering

Access to resources Recommend Favorite

A deflated iterative solver for magnetostatic finite element models with large differences in permeability*

By De Gersem H.   Hameyer K.  

EPJ Applied Physics (The), Vol. 13, Iss. 1, 2010-03 ,pp. : 45-49

Edp Sciences

Access to resources Recommend Favorite