| Автор | Carlsen, Toke M. |
| Автор | Eilers, Søren |
| Дата выпуска | 2007 |
| dc.description | We present an algorithm which for any aperiodic and primitive substitution outputs a finite representation of each special word in the shift space associated to that substitution, and determines when such representations are equivalent under orbit and shift tail equivalence. The algorithm has been implemented and applied in the study of certain new invariants for flow equivalence of substitutional dynamical systems. |
| Формат | application.pdf |
| Издатель | EDP Sciences |
| Копирайт | © EDP Sciences, 2007 |
| Тема | Sustitution |
| Тема | shift spaces |
| Тема | special elements |
| Тема | orbit equivalence |
| Тема | shift tail equivalence |
| Название | A graph approach to computing nondeterminacy in substitutional dynamical systems |
| Тип | research-article |
| DOI | 10.1051/ita:2007020 |
| Electronic ISSN | 1290-385X |
| Print ISSN | 0988-3754 |
| Журнал | RAIRO - Theoretical Informatics and Applications |
| Том | 41 |
| Первая страница | 285 |
| Последняя страница | 306 |
| Аффилиация | Carlsen Toke M.; University of Copenhagen, Universitetsparken 5, 2100 Copenhagen Ø, Denmark; toke@math.ku.dk; School of Mathematical & Physical Sciences, Mathemathics Building - V123, University of Newcastle, University Drive, Callaghan NSW 2308, Australia. |
| Аффилиация | Eilers Søren; University of Copenhagen, Universitetsparken 5, 2100 Copenhagen Ø, Denmark; eilers@math.ku.dk |
| Выпуск | 3 |
