About the \(p\)-paperfolding words (Q1351443)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	About the \(p\)-paperfolding words	scientific article

Statements

scholarly article

0 references

About the \(p\)-paperfolding words (English)

0 references

0 references

Theoretical Computer Science

0 references

publication date

27 February 1997

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0304-3975(95)00008-9

0 references

The number of factors in a paperfolding sequence

0 references

Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers

0 references

On the complexity of infinite sequences

0 references

Canonical positions for the factors in paperfolding sequences

0 references

Factors of generalized Rudin-Shapiro sequences

0 references

Uniform tag sequences

0 references

0 references

Complexity of Toeplitz sequences

0 references

A result about languages concerning paperfolding sequences

0 references

0 references

Le p-pliage de papier

0 references

0 references

0 references

Some studies on the \((p,q)\)-type sequences

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0304-3975(95)00008-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1351443

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