Abstract
We consider the well-known problem of string overlapping in connection with the so-called Penney Ante game with a q-sided die. We propose a simple and effective algorithm for calculation and visualization of Conway matrices Cn and the corresponding matrices Pn that give probabilities that player (1) will win for the chosen words w1 and w2 via the standard technique of the multidimensional discrete Fourier transform (DFT). We consider also the Hamming weight-spectra of these matrices and propose an algorithm for their computation and visualization.
Sign-in/Register to access full text options 
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.
