Skip to search formSkip to main contentSkip to account menu

Square-free word

Known as: Cube-free word, Squarefree word 
In combinatorics, a square-free word is a word (a sequence of characters) that does not contain any subword twice in a row. Thus a square-free word… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Critical exponent of a wordGraph (discrete mathematics)Kolakoski sequencePath (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
New Feature Extraction Method for Mammogram Computer Aided Diagnosis
Computer-aided diagnosis (CADx) is usually used as a second opinion by the radiologists. Improving CADx increases the treatment… 
2011
2011
Urban Open space Use in Addis Ababa: The case of Meskel Square
Urban planning and design has proven to be an important element in shaping life styles, solving problems and giving new ways of… 
2007
2007
Comparação de distribuições de probabilidade e estimativa da precipitação provável para região de Barbacena, MG
Probabilistic studies involving climatic variables are of extreme importance for farming activities, construction, tourism, among… 
Highly Cited
2006
Highly Cited
2006
An Adaptive Strategy for Quality-Based Data Reduction in Wireless Sensor Networks
Wireless sensor networks allow fine-grained observations of real-world phenomena. However, providing constant measurement updates… 
Highly Cited
2006
Highly Cited
2006
Fabrication of Transmission Color Filters Using Silicon Subwavelength Gratings on Quartz Substrates
We investigate theoretically and experimentally transmission color filters using silicon subwavelength gratings on quartz… 
Highly Cited
2002
Highly Cited
2002
There Are Ternary Circular Square-Free Words of Length n for n >= 18
There are circular square-free words of length $n$ on three symbols for $n\ge 18$. This proves a conjecture of R. J. Simpson. 
1999
1999
A Cost Analysis of Health Care Professional Negotiating Legislation
Highly Cited
1988
Highly Cited
1988
Computing on an anonymous ring
The computational capabilities of a system of <italic>n</italic> indistinguishable (anonymous) processors arranged on a ring in… 
Highly Cited
1985
Highly Cited
1985
Computing on an anonymous ring
The computational capabilities of a system of n indistinguishable (anonymous) processors arranged on a ring in the synchronous… 
Highly Cited
1982
Highly Cited
1982
Neutron diffraction refinement of the structure of gypsum, CaSO4.2H2O
The crystal structure of gypsum, CASO4.2H20, has been refined to R w -0.023 and R -0.036 for 610 neutron diffraction intensities… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)