Article ID Journal Published Year Pages File Type
4949783 Discrete Applied Mathematics 2017 13 Pages PDF
Abstract
The allowed patterns of a map are those permutations in the same relative order as the initial segments of orbits realized by the map. In this paper, we characterize and provide enumerative bounds for the allowed patterns of signed shifts, a family of maps on infinite words.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Characterization of the allowed patterns of signed shifts
Authors
,