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
••
TL;DR: Abelian versions of the critical factorization theorem are studied to show that the constraints for abelian powers implying periodicity should be quite strong, but still natural analogies exist.
Abstract: In the paper we study abelian versions of the critical factorization theorem. We investigate both similarities and differences between the abelian powers and the usual powers. The results we obtained show that the constraints for abelian powers implying periodicity should be quite strong, but still natural analogies exist.
26 citations
••
18 Jun 2012TL;DR: The results indicate that a part of the marketplace can be explained with traditional models but free applications use complex revenue models, and four general business strategy categories for further studies are identified.
Abstract: Mobile application ecosystems have growth rapidly in the past few years. Increasing number of startups and established developers are alike offering their products in different marketplaces such as Android Market and Apple App Store. In this paper, we are studying revenue models used in Android Market. For analysis, we gathered the data of 351,601 applications from their public pages at the marketplace. From these, a random sample of 100 applications was used in a qualitative study of revenue streams. The results indicate that a part of the marketplace can be explained with traditional models but free applications use complex revenue models. Basing on the qualitative analysis, we identified four general business strategy categories for further studies.
26 citations
••
TL;DR: It is shown that all the three basic non-context-free constructions in natural languages, that is, multiple agreements, crossed agreements, and duplication, can be realized using this type of grammars and that these languages are parsable in polynomial time.
25 citations
••
20 Sep 1999TL;DR: The purpose of this paper is to show how to incorporate the results of safety analysis into an action system specification by encoding this information via available composition operators for action systems in order to specify robust and safe controllers.
Abstract: Formal methods give us techniques to specify the functionality of a system, to verify its correctness or to develop the system stepwise from an abstract specification to its implementation. These aspects are important when designing safety-critical systems. Safety analysis is a vital part of the development of such systems. However, formal methods seldom interface well with the more informal techniques developed for safety analysis. Action systems is a formal approach to distributed computing that has proven its worth in the design of safety-critical systems. The approach is based on a firm mathematical foundation within which the reasoning about the correctness and behaviour of the system under development is carried out. The purpose of this paper is to show how we can incorporate the results of safety analysis into an action system specification by encoding this information via available composition operators for action systems in order to specify robust and safe controllers.
25 citations
••
TL;DR: This paper proposes in this paper a string-based framework inspired by the principle of self-assembly: two strings with a common overlap, say uv and vw, yield a string uvw; it is said that string uVw has been assembled from strings uvand vw.
25 citations
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 |