Abstract
A procedure for calculating the (auto)correlation function , of an m-dimensional complex-valued automatic sequence , is presented. This is done by deriving a recursion for the vector correlation function Γker(f)(k) whose components are the (cross)correlation functions between all sequences in the finite set ker(f), the so-called kernel of f which contains all properly defined decimations of f. The existence of Γker(f)(k), which is defined as a limit, for all , is shown to depend only on the existence of Γker(f)(0). This is illustrated for the higher-dimensional Thue–Morse, paper folding and Rudin–Shapiro sequences.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
