Auflistung FB 07 - Mathematik und Informatik, Physik, Geographie nach Autor "Kutrib, Martin"
Anzeige der Dokumente 1-20 von 41
-
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 ... -
5. Theorietag : "Automaten und Formale Sprachen" : Schloss Rauischholzhausen, 28./29.09.1995
Kutrib, Martin; Worsch, Thomas (1995) -
A Time Hierarchy for Bounded One-Way Cellular Automata
Klein, Andreas; Kutrib, Martin (2001) -
Automata 2013 : exploratory papers ; 19th International Workshop on Cellular Automata and Discrete Complex Systems, Giessen, Germany, Sept. 17-19, 2013
Kari, Jarkko; Kutrib, Martin; Malcher, Andreas (Hrsg.) (2013) -
Automata arrays and context-free languages
Kutrib, Martin (1999)From a biological point of view automata arrays have been employed by John von Neumann in order to solve the logical problem of nontrivial self-reproduction. From a computer scientific point of view they are a model for ... -
Below linear-time : Dimensions versus time
Kutrib, Martin (2000)Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form id + r where r E o(id) is a sublinear function. It is shown that ... -
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 ... -
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 ... -
Deterministic Turing machines in the range between real-time and linear-time
Klein, Andreas; Kutrib, Martin (2000)Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form n ... -
Economy of Description for Basic Constructions on Rational Transductions
Bordihn, Henning; Holzer, Markus; Kutrib, Martin (2002) -
Efficient universal pushdown cellular automata and their application to complexity
Kutrib, Martin (2000)In order to obtain universal classical cellular automata an infinite space is required. Therefore, the number of required processors depends on the length of input data and, additionally, may increase during the computation. ... -
Fast One-Way Cellular Automata
Klein, Andreas; Kutrib, Martin (2001) -
Fault tolerant parallel pattern recognition
Kutrib, Martin; Löwe, Jan-Thomas (2000)The general capabilities of fault tolerant computations in one-way and two-way linear cellular arrays are investigated in terms of pattern recognition. The defective processing elements (cells) that cause the misoperations ... -
Flip-Pushdown Automata: k+1 Pushdown Reversals are Better Than k
Holzer, Markus; Kutrib, Martin (2002) -
Flip-Pushdown Automata: Nondeterminism is Better Than Determinism
Holzer, Markus; Kutrib, Martin (2003) -
Grammars with Scattered Nonterminals
Klein, Andreas; Kutrib, Martin (2002) -
Improving Raster Image Run-Length Encoding Using Data Order
Holzer, Markus; Kutrib, Martin (2001) -
Informatik an der JLUG : "Interdiziplinärer Workshop"
Kröger, Henner; Kutrib, Martin (1996) -
Iterative arrays with a wee bit alternation
Buchholz, Thomas; Klein, Andreas; Kutrib, Martin (1999)An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. We are ... -
Iterative arrays with limited nondeterministic communication cell
Buchholz, Thomas; Klein, Andreas; Kutrib, Martin (1999)Iterative arrays with restricted nondeterminism are investigated. Non-determinism is provided for the distinguished communication cell only. All the other cells are deterministic ones. Moreover, the number of allowed ...