A generalization of repetition threshold (Q2575754): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
aliases / en / 0aliases / en / 0
 
Mathematical Foundations of Computer Science 2004
description / endescription / en
 
scientific article; zbMATH DE number 2196824
Property / title
 
Mathematical Foundations of Computer Science 2004 (English)
Property / title: Mathematical Foundations of Computer Science 2004 (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1097.68110 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/b99679 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
22 August 2005
Timestamp+2005-08-22T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 22 August 2005 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 2196824 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2488008928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly growing k-th power-free homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un théorème de Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: On repetitions of blocks in binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nonrepetitive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many squares must a binary sequence contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of repetition threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite 0-1 sequences without long adjacent identical blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS / rank
 
Normal rank

Latest revision as of 13:47, 11 June 2024

scientific article; zbMATH DE number 2196824
  • Mathematical Foundations of Computer Science 2004
Language Label Description Also known as
English
A generalization of repetition threshold
scientific article; zbMATH DE number 2196824
  • Mathematical Foundations of Computer Science 2004

Statements

A generalization of repetition threshold (English)
0 references
Mathematical Foundations of Computer Science 2004 (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
6 December 2005
0 references
22 August 2005
0 references
0 references
0 references
Combinatorics on words
0 references
Repetitions
0 references
0 references
0 references
0 references