A generator of morphisms for infinite words (Q3421905)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A generator of morphisms for infinite words	scientific article

Statements

scholarly article

0 references

A generator of morphisms for infinite words (English)

0 references

0 references

RAIRO - Theoretical Informatics and Applications

0 references

publication date

8 February 2007

0 references

full work available at URL

http://www.numdam.org/item?id=ITA_2006__40_3_427_0

0 references

http://www.numdam.org/item?id=ITA_2006__40_3_427_0/

0 references

https://eudml.org/doc/92811

0 references

MaRDI profile type

MaRDI publication profile

0 references

Growth problems for avoidable words

0 references

Avoidable patterns in strings of symbols

0 references

Open Problems in Pattern Avoidance

0 references

Sur un théorème de Thue

0 references

How many squares must a binary sequence contain?

0 references

A generalization of repetition threshold

0 references

Polynomial versus exponential growth in repetition-free binary words

0 references

0 references

Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters

0 references

A propos d'une conjecture de F. Dejean sur les répétitions dans les mots

0 references

Avoiding large squares in infinite binary words

0 references

SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS

0 references

BLOCKING SETS OF TERMS

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1051/ITA:2006020

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3421905

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3421905&oldid=39309139"