We complete the initial study of jumping finite automata, which was started in a former article
of Meduna and Zemek [7]. The open questions about basic closure properties are solved …

We investigate in this article the operations of insertion and deletion working in a matrix-
controlled manner. We show that this allows to us strictly increase the computational power …

In this article we introduce the operations of insertion and deletion working in random
context and semi-conditional modes. We show that conditional application of insertion and …

First, we show that universality and other properties of general jumping finite automata are
undecidable, which answers questions asked by Meduna and Zemek in 2012 [12]. Second …

In this article we consider insertion-deletion P systems inserting or deleting one symbol in
one or two symbol (s) left context (more precisely of size (1, 2, 0; 1, 1, 0) and (1, 1, 0; 1, 2, 0)) …

Insertion-deletion systems have been introduced as a formalism to model operations that
find their counterparts in ideas of bio-computing, more specifically, when using DNA or RNA …

With good biological motivation, we add substitutions as a further type of operations to (in
particular, context-free) insertion-deletion systems. This way, we obtain new …

We discuss substitutions as a further type of operations, added to (in particular, one-sided)
insertion-deletion systems. This way, we obtain new characterizations of classes of context …

In this article we introduce the operations of insertion and deletion working in a random-
context and semi-conditional manner. We show that the conditional use of rules strictly …

Multiple original results in the theory of automata and formal languages are presented,
dealing mainly with combinatorial problems and complexity questions related to reset words …