scientific article; zbMATH DE number 3932412

From MaRDI portal
Publication:3704906





[For the entire collection see Zbl 0533.00025.] This paper is a survey of results on square-free words which contains numerous references to the literature, where the original results and their proofs can be found. Topics covered include the existence of square-face words, the complexity of algorithms to find all repetitions of a word of length n \((=O(n \log n))\), bounds on the number of square- free words of a given length over a fixed alphabet, and square-free morphisms of languages. Several open problems are mentioned.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704906)