• 18. Theorietag "Automaten und Formale Sprachen" : Wettenberg-Launsbach bei Gießen 30. September - 2. Oktober 2008 

      Holzer, Markus; Kutrib, Martin; Malcher, Andreas (2008)
      Der Theorietag ist die Jahrestagung der Fachgruppe Automaten und Formale Sprachen der Gesellschaft für Informatik. Er wird seit 1991 von Mitgliedern der Fachgruppe an wechselnden Orten in Deutschland und Österreich ...
    • Cellular automata with sparse communication 

      Kutrib, Martin; Malcher, Andreas (2009)
      We investigate cellular automata whose internal inter-cell communication is bounded. The communication is quantitatively measured by the number of uses of the links between cells. Bounds on the sum of all communications ...
    • Descriptional complexity of pushdown store languages 

      Malcher, Andreas; Meckel, Katja; Mereghetti, Carlo; Palano, Beatrice (2012)
      It is well known that the pushdown store language P(M) of a pushdown automaton (PDA) M i.e., the language consisting of words occurring on the pushdownalong accepting computations of M is a regular language. Here, we ...
    • Deterministic set automata 

      Kutrib, Martin; Malcher, Andreas; Wendlandt, Matthias (2014)
      We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the ...