• On the descriptional complexity of operations on semilinear sets 

      Beier, Simon; Holzer, Markus; Kutrib, Martin (2017)
      We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters ...
    • Properties of right one-way jumping finite automata 

      Beier, Simon; Holzer, Markus (2018)
      Right one-way jumping finite automata (ROWJFAs), were recently introduced in [H. Chigahara, S.Z. Fazekas, A. Yamamura: One-Way Jumping Finite Automata, Internat. J. Found. Comput. Sci., 27(3), 2016] and are jumping automata ...
    • Semi-Linear Lattices and Right One-Way Jumping Finite Automata 

      Beier, Simon; Holzer, Markus (2019)
      Right one-way jumping automata (ROWJFAs) are an automaton model that was recently introduced for processing the input in a discontinuous way. In [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. ...