@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{BordihnHolzer2021,
  author    = {Bordihn, Henning and Holzer, Markus},
  title     = {On the number of active states in finite automata},
  series = {Acta informatica},
  volume    = {58},
  journal   = {Acta informatica},
  number    = {4},
  publisher = {Springer},
  address   = {Berlin ; Heidelberg [u.a.]},
  issn      = {0001-5903},
  doi       = {10.1007/s00236-021-00397-8},
  pages     = {301 -- 318},
  year      = {2021},
  abstract  = {We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active states of an automaton A on input w counts the number of different states visited during the most economic computation of the automaton A for the word w. This concept generalizes to finite automata and regular languages in a straightforward way. We show that the number of active states of both finite automata and regular languages is computable, even with respect to nondeterministic finite automata. We further compare the number of active states to related measures for regular languages. In particular, we show incomparability to the radius of regular languages and that the difference between the number of active states and the total number of states needed in finite automata for a regular language can be of exponential order.},
  language  = {en}
}