ECErzsébet Csuhaj-Varjú

Erzsébet Csuhaj-Varjú

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Erzsébet Csuhaj-Varjú has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Computational completeness of minimal communication with small number of cells

    by Erzsébet Csuhaj-Varjú, Sergey Verlan

    Generalized communicating P systems (GCPSs for short) are a common generalization of tissue-like P systems (networks of cells) where each interaction rule can move only two objects through the cells. Depending on the source and target cells, nine types of such rules are distinguished. Previous works have shown that several GCPSs families where the GCPSs use only one type of rules and have only three cells are computationally complete devices. In this paper, we show that GCPSs with only parallel-shift rules and only four cells, and GCPSs with only presence-move rules and only three cells are computationally complete as well. With these new results, we contribute to the research goal of providing a sharp lower bound on the number of cells needed to achieve computational completeness for all families of GCPSs where GCPSs use only one type of interaction rules.


  • Open Access

    Length-driven communication in networks of evolutionary processors

    by Erzsébet Csuhaj-Varjú, Pramod Kumar Sethy

    In this paper, we introduce a new method of filtering strings before communication in networks of evolutionary processors which is based on whether the length of strings at the given node increases, decreases, or remains unchanged after an evolutionary step is performed. This filtering mechanism differs from the usual ones, where context conditions are considered, as it is based only on quantitative conditions (the lengths of the strings) and does not take into account qualitative properties of the string to be communicated. We prove that any recursively enumerable language can be obtained as the language of a variant of hybrid networks of evolutionary processors with this new communication mode. We also show how two well-known NP-complete problems can be solved by the new model in linear time.


  • Generalized Distributed Reaction Systems

    by Artiom Alhazov, Erzsébet Csuhaj-Varjú, Pramod Kumar Sethy

    In this paper, we introduce the notion of a generalized distributed reaction system with computations following the concept of the original reaction system: the resulting products in the individual components are obtained by applying rules which take into account the objects in the components of the system as reactants and inhibitors and yield results in specified components of the system. As specific variants, we investigate (i) generalized distributed reaction systems which look at all components for the presence or absence of objects, but the resulting products are only produced in the component the rule is assigned to as well as (ii) generalized distributed reaction systems which look for the presence or absence of objects only in the component the rule is assigned to, but the resulting products can be sent to specified components within the whole system. We first show how all these variants of generalized distributed reaction systems can be flattened to a reaction system having only one component. Moreover, we show how each of these two variants, which are restricted variants of the general model, can simulate even the general model. Finally, we prove that all these variants of generalized distributed reaction systems working with the standard, total parallel application of rules can be transferred into a usual reaction system working with the sequential application of rules.


  • Open Access

    Networks of Watson-Crick D0L systems with communication by substrings

    by Erzsébet Csuhaj-Varjú, György Vaszil

  • Open Access

    Variants of distributed reaction systems

    by Erzsébet Csuhaj-Varjú, György Vaszil

    A distributed reaction system consists of a finite set of reaction systems that either interact with a common environment or interact with each other by communicating products or reactions. A reaction system is a well-known qualitative formal model of interactions between biochemical reactions. A reaction is a triplet of nonempty sets representing chemicals, called the set of reactants, the set of inhibitors, and the set of products. A reaction corresponds to a chemical reaction performed on a set of chemicals, and a reaction system is a finite nonempty set of reactions. In this paper, we examine two variants of distributed reaction systems. We introduce the notion of a distributed reaction system with communication by request (a qDRS for short), where sets of products are communicated between the component reaction systems by queries. First, we show that every qDRS can be represented by a reaction system. After that we compare distributed reaction systems with communication by request to extended distributed reaction systems (EDRSs), models that were introduced in a previous paper. We prove that extended distributed reaction systems, where a context automaton provides input for the component reaction systems, simulate distributed reaction systems with communication by request and distributed reaction systems with communication by request simulate special variants of extended distributed reaction systems. Furthermore, we assign languages to these two variants of distributed reaction systems. We prove that the class of agreement languages of extended distributed reaction systems is equal to the class of languages of nondeterministic multihead finite automata and the agreement language of every distributed reaction system with communication by request is an element of a certain subregular language class.


  • Open Access

    About reversibility in sP colonies and reaction systems

    by Ludek Cienciala, Lucie Ciencialová, Erzsébet Csuhaj-Varjú

    In this paper, we study reversibility in sP colonies and in reaction systems. sP colony is a bio-inspired computational model formed from an environment and a finite set of agents. The current state of the environment is represented by a finite set of objects and the current state of the agent is given by a finite multiset of objects. By execution of a program from a set of programs associated with the agent, the agent can change the objects in its own state and possibly in the environment, too. Reaction systems are a bio-inspired computational model where reactants are transformed into products only if some inhibitors are not present. We define sP colonies without input influence and prove that to any reversible sP colony of such type an inverse sP colony can be constructed that performs inverse computation. In the second part of the paper, we show that the concept of a reversible reaction system and the notion of an inverse reaction system can be defined in a similar way, and partially reversible reaction systems can simulate reversible logic gates and reversible Turing machines.


  • Languages of Distributed Reaction Systems

    by Lucie Ciencialová, Luděk Cienciala, Erzsébet Csuhaj-Varjú


  • Open Access

    P colonies and reaction systems

    by Lucie Ciencialová, Luděk Cienciala, Erzsébet Csuhaj-Varjú


  • On Languages of P Automata

    by Erzsébet Csuhaj-Varjú, György Vaszil

    P automata are accepting computing devices combining features of classical automata and membrane systems. In this paper we introduce P n -stack-automata, a restricted class of P automata that mimics the behaviour of n -stack automata. We show that fo