We investigate two generalizations of insertion and deletion of words, that have recently
become of interest in the context of molecular computing. Given a pair of words (x, y), called …

Beginning with an informal introduction to language equations, this book presents a
framework for a general theory for solving systems of equations and relations between …

In the talk we give an overview of recent developments in the area of language equations,
with an emphasis on methods for dealing with non-classical types of equations whose …

An important step in the design of a complex system is its decomposition into a number of
interacting components, of which some are given (known) and some need to be synthesized …

Equations with formal languages as unknowns using all Boolean operations and
concatenation are studied. Their main properties, such as solution existence and …

We describe a new way to model deletion operations on formal languages, called deletion
along trajectories. We examine its closure properties, which differ from those of shuffle on …

The problem of negative design of DNA languages is addressed, that is, properties and
construction methods of large sets of words that prevent undesired bonds when used in …

The process of gene unscrambling in ciliates (a type of unicellular protozoa), which
accomplishes the difficult task of re-arranging gene segments in the correct order and …

In this work, we investigate computational complexity of the solution existence problem for
language equations and language constraints. More accurately, we study constraints …

The input data for DNA computing must be encoded into the form of single or double DNA
strands. As complementary parts of single strands can bind together forming a double …