Hae
Aineistot 21-30 / 66
Garbling Schemes and Applications
(Turku Centre for Computer Science, 2017-03-17)
The topic of this thesis is garbling schemes and their applications. A garbling scheme is a set of algorithms for realizing secure two-party computation. A party called a client possesses a private algorithm ...
Combinatorics of Pisot Substitutions
(Turku Centre for Computer Science, 2013-11-25)
On Undecidable Dynamical Properties of Reversible One-Dimensional Cellular Automata
(Turku Centre for Computer Science, 2010-10-29)
Cellular automata are models for massively parallel computation. A cellular automaton consists of cells which are arranged in some kind of regular lattice and a local update rule which updates the state of each cell according ...
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 ...
Subshifts with Simple Cellular Automata
(Turku Centre for Computer Science, 2014-06-28)
A subshift is a set of infinite one- or two-way sequences over a fixed finite set, defined by a set of forbidden patterns. In this thesis, we study subshifts in the topological setting, where the natural morphisms between ...
Structural and Computational Existence Results for Multidimensional Subshifts
(Turku Centre for Computer Science, 2015-07-31)
Symbolic dynamics is a branch of mathematics that studies the structure of infinite sequences of symbols, or in the multidimensional case, infinite grids of symbols. Classes of such sequences and grids defined by collections ...
Order-Theoretic Methods for Space-Time Coding: Symmetric and Asymmetric Designs
(Turku Centre for Computer Science, 2009-01-09)
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 ...
Similarity Relations on Words: Relational Codes and Periods
(Turku Centre for Computer Science, 2008-02-22)
Rich Words and Balanced Words
(Turku Centre for Computer Science, 2016-09-23)
This thesis is mostly focused on palindromes. Palindromes have been studied extensively, in recent years, in the field of combinatorics on words.Our main focus is on rich words, also known as full words. These are words ...