Characterization of some binary words with few squares

Golnaz Badkobeh; Pascal Ochem

doi:10.1016/j.tcs.2015.03.044

Journal Articles Theoretical Computer Science Year : 2015

Characterization of some binary words with few squares

(1) , (2)

1
2

Golnaz Badkobeh

Function : Author

Informatics

Pascal Ochem

Function : Author
PersonId : 7098
IdHAL : pascal-ochem
ORCID : 0000-0001-5504-4586
IdRef : 109150902

Algorithmes, Graphes et Combinatoire

CV

Keywords

Combinatorial problems Repetitions Avoidability

Domains

Discrete Mathematics [cs.DM]

Pascal Ochem : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263844

Submitted on : Thursday, January 28, 2016-12:18:11 PM

Last modification on : Tuesday, September 3, 2024-1:56:20 PM

Dates and versions

lirmm-01263844 , version 1 (28-01-2016)

Identifiers

HAL Id : lirmm-01263844 , version 1
DOI : 10.1016/j.tcs.2015.03.044

Cite

Golnaz Badkobeh, Pascal Ochem. Characterization of some binary words with few squares. Theoretical Computer Science, 2015, 588, pp.73-80. ⟨10.1016/j.tcs.2015.03.044⟩. ⟨lirmm-01263844⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER

106 View

0 Download

Characterization of some binary words with few squares

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share