This article investigates insertion–deletion systems of small size, where at most two symbols
can be used in the description of insertion or deletion rules in a context-free or contextual …

In this article we continue the investigation of insertion-deletion systems having a context only
on one side of insertion or deletion rules. We show a counterpart of the results obtained in (…

In this paper, we consider insertion–deletion P systems with priority of deletion over insertion.
We show that such systems with one-symbol context-free insertion and deletion rules are …

This paper presents a clustering-based approach to topic modeling via analyzing word
networks based on the adaptation of a community detection algorithm. Word networks are …

Recent investigations show insertion-deletion systems of small size that are not complete
and cannot generate all recursively enumerable languages. However, if additional …

Computing by Observing is a theoretical model for computation that tries to formalize the
standard setup of experiments in natural sciences. We establish that insertion systems with …

… Alexander Krassovitskiy 2Research Group on Mathematical Linguistics, Rovira i Virgili
University, Av. Catalunya, 35, Tarragona 43002 Spain, E-mail: alexander. … Krassovitskiy, Y …

This article presents an approach for spellchecking and autocorrection using web data for
morphologically complex languages (in the case of Kazakh language), which can be …

In this article we continue the investigation of insertion-deletion systems having a context
only on one side of insertion or deletion rules. We investigate the combination of systems …

This paper focuses on P systems with one-symbol insertion and deletion without contexts.
The main aim of this paper is to consider the operations applied at the ends of the string, and …