@misc{BordihnNagyVaszil2018,
  author    = {Bordihn, Henning and Nagy, Benedek and Vaszil, Gy{\"o}rgy},
  title     = {Preface: Non-classical models of automata and applications VIII},
  series = {RAIRO-Theoretical informatics and appli and applications},
  volume    = {52},
  journal   = {RAIRO-Theoretical informatics and appli and applications},
  number    = {2-4},
  publisher = {EDP Sciences},
  address   = {Les Ulis},
  issn      = {0988-3754},
  doi       = {10.1051/ita/2018019},
  pages     = {87 -- 88},
  year      = {2018},
  language  = {en}
}
@article{BordihnVaszil2020,
  author    = {Bordihn, Henning and Vaszil, Gy{\"o}rgy},
  title     = {Deterministic Lindenmayer systems with dynamic control of parallelism},
  series = {International journal of foundations of computer science},
  volume    = {31},
  journal   = {International journal of foundations of computer science},
  number    = {1},
  publisher = {World Scientific},
  address   = {Singapore},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054120400031},
  pages     = {37 -- 51},
  year      = {2020},
  abstract  = {M-rate 0L systems are interactionless Lindenmayer systems together with a function assigning to every string a set of multisets of productions that may be applied simultaneously to the string. Some questions that have been left open in the forerunner papers are examined, and the computational power of deterministic M-rate 0L systems is investigated, where also tabled and extended variants are taken into consideration.},
  language  = {en}
}
@article{BordihnVaszil2021,
  author    = {Bordihn, Henning and Vaszil, Gy{\"o}rgy},
  title     = {Reversible parallel communicating finite automata systems},
  series = {Acta informatica},
  volume    = {58},
  journal   = {Acta informatica},
  number    = {4},
  publisher = {Springer},
  address   = {Berlin ; Heidelberg ; New York, NY},
  issn      = {0001-5903},
  doi       = {10.1007/s00236-021-00396-9},
  pages     = {263 -- 279},
  year      = {2021},
  abstract  = {We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.},
  language  = {en}
}
@article{CsuhajVarjuDassowVaszil2010,
  author    = {Csuhaj-Varj{\´u}, Erzs{\´e}bet and Dassow, Juergen and Vaszil, Gy{\"o}rgy},
  title     = {Variants of competence-based derivations in CD grammar systems},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054110007428},
  year      = {2010},
  abstract  = {In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.},
  language  = {en}
}