Hae
Aineistot 21-30 / 36
On Identifying and Locating-Dominating Codes
(Turku Centre for Computer Science, 2011-06-22)
On Distributed Storage Codes
(Turku Centre for Computer Science, 2015-02-13)
Distributed storage systems are studied. The interest in such system has become relatively wide due to the increasing amount of information needed to be stored in data centers or different kinds of cloud systems. There are ...
Hierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type
(Turku Centre for Computer Science, 2016-03-11)
Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. In this thesis, we study two-dimensional subshifts offinite type (2D SFTs), where the underlying grid is Z2 and the ...
Defining Contexts in Context-Free Grammars
(Turku Centre for Computer Science, 2015-09-25)
This thesis introduces an extension of Chomsky’s context-free grammars equipped with operators for referring to left and right contexts of strings.The new model is called grammar with contexts.
The semantics of ...
Privileged Words and Sturmian Words
(Turku Centre for Computer Science, 2016-08-19)
This dissertation has two almost unrelated themes: privileged words and Sturmian words. Privileged words are a new class of words introduced recently. A word is privileged if it is a complete first return to a shorter ...
On The Mean Square of Quadratic Dirichlet L-Functions at 1
(Suomalainen tiedeakatemia, 2008-04-16)
Efficient Optimization Algorithms for Nonlinear Data Analysis
(Turku Centre for Computer Science, 2014-12-05)
Identification of low-dimensional structures and main sources of variation from multivariate data are fundamental tasks in data analysis. Many methods aimed at these tasks involve solution of an optimization problem. Thus, ...
Word Equations and Related Topics. Independence, Decidability and Characterizations
(Turku Centre for Computer Science, 2012-05-18)
The three main topics of this work are independent systems and chains of
word equations, parametric solutions of word equations on three unknowns,
and unique decipherability in the monoid of regular languages.
The ...
Numbers and Languages
(Turku Centre for Computer Science, 2013-03-15)
The thesis presents results obtained during the authors PhD-studies. First systems of language equations of a simple form consisting of just two equations are proved to be computationally universal. These are systems over ...
Conservation Laws in Cellular Automata
(Turku Centre for Computer Science, 2009-04-17)
Conservation laws in physics are numerical invariants of the dynamics of a system. In cellular automata (CA), a similar concept has already been defined and studied. To each local pattern of cell states a real value is ...









