On Prefix/Suffix-Square Free Words (Q2949834)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On Prefix/Suffix-Square Free Words	scientific article

Statements

scholarly article

0 references

On Prefix/Suffix-Square Free Words (English)

0 references

Marius Dumitran

0 references

0 references

0 references

String Processing and Information Retrieval

0 references

publication date

2 October 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-23826-5_6

0 references

Prefix-suffix duplication

0 references

0 references

Algorithms on Strings, Trees and Sequences

0 references

A Minimal Periods Algorithm with Applications

0 references

Testing Generalised Freeness of Words

0 references

Detecting leftmost maximal periodicities

0 references

Mathematical Foundations of Computer Science 2003

0 references

Linear work suffix array construction

0 references

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays

0 references

0 references

Decomposable searching problems

0 references

An optimal algorithm for computing the repetitions in a word

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-23826-5_6

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2949834

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