Equations enforcing repetitions under permutations

© 2020 Elsevier B.V. The notion of repetition of factors in words is central to combinatorics on words. A recent generalisation of this concept considers repetitions under permutations: given an alphabet Σ and a morphism or antimorphism f on Σ∗, whose restriction to Σ is a permutation, w is an [f]-r...

Full description

Bibliographic Details

Main Authors:	Joel Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka
Format:	Default Article
Published:	2020
Subjects:	Theory of computation not elsewhere classified Combinatorics on words Word equations Lyndon-Schutzenberger equation Fine and Wilf's theorem Pseudoperiodicity Science & Technology Physical Sciences Mathematics, Applied Mathematics Computation Theory & Mathematics Applied Mathematics Computation Theory and Mathematics
Online Access:	https://hdl.handle.net/2134/13090640.v1
Tags:	Add Tag No Tags, Be the first to tag this record!