Institution
Turku Centre for Computer Science
Facility•Turku, Finland•
About: Turku Centre for Computer Science is a facility organization based out in Turku, Finland. It is known for research contribution in the topics: Decidability & Word (group theory). The organization has 382 authors who have published 1027 publications receiving 19560 citations.
Papers published on a yearly basis
Papers
More filters
Posted Content•
TL;DR: A Devaney-chaotic reversible cellular automaton is presented that is universal in their sense, answering a question that they explicitly left open.
Abstract: Delvenne, Kůrka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally universal in this sense. The notion is defined in terms of the trace function of the system, and aims to capture its dynamics. We present a Devaney-chaotic reversible cellular automaton that is universal in their sense, answering a question that they explicitly left open. We also discuss some implications and limitations of the construction.
TL;DR: The paper investigates the number of subword occurrences in a word, in particular, in aword obtained by iterating a morphism, and finds explicit formulas in terms of n are obtained for theNumber of occurrences of subwords of length at most 2 in the nth iteration of the Fibonacci morphism.
30 Aug 1999
TL;DR: It is proved that the generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms and gives as a corollary a shorter proof for the decidability of the binary PCP.
Abstract: We prove that the generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms. This result gives as a corollary a shorter proof for the decidability of the binary PCP, proved in 1982 by Ehrenfeucht, Karhumaki and Rozenberg.
TL;DR: In this article , the impact of per-and polyfluoroalkyl substances (PFAS) exposure on the gut microbial community was investigated in a mother-infant study.
TL;DR: In this article, the authors developed polynomial methods for studying systems of word equations and analyzed how the sizes of these systems depend on the lengths of the equations. And they used these methods to give the first nontrivial upper bounds for the size of the systems.
Abstract: We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of the equations. These methods give the first nontrivial upper bounds for the sizes of the systems.
Authors
Showing all 383 results
| Name | H-index | Papers | Citations |
|---|---|---|---|
| José A. Teixeira | 101 | 1414 | 47329 |
| Cunsheng Ding | 61 | 254 | 11116 |
| Jun'ichi Tsujii | 59 | 389 | 15985 |
| Arto Salomaa | 56 | 374 | 17706 |
| Tero Aittokallio | 52 | 271 | 8689 |
| Risto Lahdelma | 48 | 149 | 6637 |
| Hannu Tenhunen | 45 | 819 | 11661 |
| Mats Gyllenberg | 44 | 204 | 8029 |
| Sampo Pyysalo | 42 | 153 | 8839 |
| Olli Polo | 42 | 140 | 5303 |
| Pasi Liljeberg | 40 | 306 | 6959 |
| Tapio Salakoski | 38 | 231 | 7271 |
| Filip Ginter | 37 | 156 | 7294 |
| Robert Fullér | 37 | 152 | 5848 |
| Juha Plosila | 35 | 342 | 4917 |