Abstract
One folds lengthwise a strip of paper in p ⩾ 2 equal parts several times on itself (all folds being parallel). After unfolding, one obtains a sequence of “valley” and “ridge” folds. If one codes these folds over a two-letter alphabet, one obtains a p-paperfolding word associated with the sequence of p-folding instructions. A p-paperfolding sequence is an infinite p-paperfolding word. This paper is devoted to the effective construction of p-uniform tag systems which generate every p-paperfolding sequence associated with ultimately periodic sequence of p-(un)folding instructions.
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.
