Optimal Description of Automatic Paperfolding Sequences
| dc.creator | Cerny,Anton | |
| dc.date | 1997 | |
| dc.date.accessioned | 2024-02-06T12:49:05Z | |
| dc.date.available | 2024-02-06T12:49:05Z | |
| dc.description | The class of 2-automatic paperfolding sequences corresponds to the class of ultimately periodic sequences of unfolding instructions. We first show that a paper-folding sequence is automatic iff it is 2-automatic. Then we provide families of minimal finite-state automata, minimal uniform tag sequences and minimal substitutions describing automatic paperfolding sequences, as well as a family of algebraic equations satisfied by automatic paperfolding sequences understood as formal power series. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-003-10-1085 | |
| dc.identifier | https://lib.jucs.org/article/27414/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7233 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 3(10): 1085-1099 | |
| dc.subject | paperfolding sequence | |
| dc.subject | automatic sequence | |
| dc.subject | uniform tag system | |
| dc.title | Optimal Description of Automatic Paperfolding Sequences | |
| dc.type | Research Article |