On shuffled-square-free words (Q2680851)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On shuffled-square-free words	scientific article

Statements

scholarly article

0 references

On shuffled-square-free words (English)

0 references

Laurent Bulteau

0 references

0 references

Stéphane Vialette

0 references

Theoretical Computer Science

0 references

publication date

4 January 2023

0 references

zbMATH Keywords

combinatorics

0 references

shuffle

0 references

complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2022.10.028

0 references

Optimal off-line detection of repetitions in a string

0 references

Handbook of Enumerative Combinatorics

0 references

Recognizing binary shuffle squares is \textsf{NP}-hard

0 references

Unshuffling a square is NP-hard

0 references

0 references

An optimal algorithm for computing the repetitions in a word

0 references

0 references

How many squares must a binary sequence contain?

0 references

Extremal square-free words

0 references

A short proof that shuffle squares are 7-avoidable

0 references

A note on the number of squares in a word

0 references

0 references

An O(n log n) algorithm for finding all repetitions in a string

0 references

Lengths of extremal square-free ternary words.

0 references

On recognising words that are squares for the shuffle product

0 references

Generating square-free words efficiently

0 references

Growth properties of power-free languages

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2022.10.028

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2680851

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