Complexity and palindromic defect of infinite words (Q620969): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086603341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of infinite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor versus palindromic complexity of uniformly recurrent infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of factors in the Thue-Morse word / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on differentiable palindromes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connection between palindromic and factor complexity using return words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and some constructions of de Luca and Rauzy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rich, Sturmian, and trapezoidal words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332270 / rank
 
Normal rank

Latest revision as of 17:58, 3 July 2024

scientific article
Language Label Description Also known as
English
Complexity and palindromic defect of infinite words
scientific article

    Statements