Bridging Two Hierarchies of Infinite Words
| dc.creator | Marcus,Solomon | |
| dc.date | 2002 | |
| dc.date.accessioned | 2024-02-06T12:51:40Z | |
| dc.date.available | 2024-02-06T12:51:40Z | |
| dc.description | Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them proceeds from particular to general, while the other proceeds from general to particular. As we shall see, the respective hierarchies don’t interfer. There is between them an empty space waiting for investigation. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-008-02-0292 | |
| dc.identifier | https://lib.jucs.org/article/27860/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8112 | |
| 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 8(2): 292-296 | |
| dc.subject | ultimately periodic infinite | |
| dc.subject | uniformly recurrent | |
| dc.subject | disjunctive | |
| dc.subject | random infinite words | |
| dc.title | Bridging Two Hierarchies of Infinite Words | |
| dc.type | Research Article |