Giessener Elektronische Bibliothek

Schriftenreihe: IFIG Research Report

Nr. Titel Autor   Jahr   Band
1 IFIG Research Report   20XX   Serie
2 On the computational complexity of partial word automata problems Holzer, Markus et al.   2014   1404 / 2014
3 Deterministic set automata Kutrib, Martin et al.   2014   1402 / 2014
4 Minimal and hyper-minimal biautomata Holzer, Markus et al.   2014   1401 / 2014
5 Automata 2013 : exploratory papers ; 19th International Workshop on Cellular Automata and Discrete Complex Systems, Giessen, Germany, Sept. 17-19, 2013 Kari, Jarkko et al.   2013   1302 / 2013
6 Minimization, Characterizations, and Nondeterminism for Biautomata Holzer, Markus et al.   2013   1301 / 2013
7 Descriptional complexity of pushdown store languages Malcher, Andreas et al.   2012   1203 / 2012
8 On the complexity of rolling block and Alice mazes Holzer, Markus et al.   2012   1202 / 2012
9 Grid graphs with diagonal edges and the complexity of Xmas mazes Holzer, Markus et al.   2012   1201 / 2012
10 Simplifying regular expressions : A quantitative perspective Gruber, Hermann et al.   2009   0904 / 2009
11 Cellular automata with sparse communication Kutrib, Martin et al.   2009   0903 / 2009
12 Tight bounds on the descriptional complexity of regular expressions Gruber, Hermann et al.   2009   0901 / 2009
13 18. Theorietag "Automaten und Formale Sprachen" : Wettenberg-Launsbach bei Gießen 30. September – 2. Oktober 2008 Holzer, Markus et al.   2008   0801 / 2008
14 Flip-Pushdown Automata: Nondeterminism is Better Than Determinism Holzer, Markus et al.   2003   0301 / 2003
15 Flip-Pushdown Automata: k+1 Pushdown Reversals are Better Than k Holzer, Markus et al.   2002   0206 / 2002
16 Nondeterministic Descriptional Complexity of Regular Languages Holzer, Markus et al.   2002   0205 / 2002
17 Economy of Description for Basic Constructions on Rational Transductions Bordihn, Henning et al.   2002   0204 / 2002
18 String Transformation for n-dimensional Image Compression Kutrib, Martin et al.   2002   0203 / 2002
19 Grammars with Scattered Nonterminals Klein, Andreas et al.   2002   0202 / 2002
20 Self-Assembling Finite Automata Klein, Andreas et al.   2002   0201 / 2002
21 Unary Language Operations and Their Nondeterministic State Complexity Holzer, Markus et al.   2001   0107 / 2001
22 Fast One-Way Cellular Automata Klein, Andreas et al.   2001   0106 / 2001
23 Improving Raster Image Run-Length Encoding Using Data Order Holzer, Markus et al.   2001   0105 / 2001
24 Refining Nondeterminism Below Linear-Time Kutrib, Martin   2001   0104 / 2001
25 State Complexity of Basic Operations on Nondeterministic Finite Automata Holzer, Markus et al.   2001   0103 / 2001
26 Massively Parallel Fault Tolerant Computations on Syntactical Patterns Kutrib, Martin et al.   2001   0102 / 2001
27 A Time Hierarchy for Bounded One-Way Cellular Automata Klein, Andreas et al.   2001   0101 / 2001
28 Below linear-time : Dimensions versus time Kutrib, Martin   2000   0005 / 2000
29 Efficient universal pushdown cellular automata and their application to complexity Kutrib, Martin   2000   0004 / 2000
30 Massively parallel pattern recognition with link failures Löwe, Jan-Thomas et al.   2000   0003 / 2000
31 Deterministic Turing machines in the range between real-time and linear-time Klein, Andreas et al.   2000   0002 / 2000
32 Fault tolerant parallel pattern recognition Kutrib, Martin et al.   2000   0001 / 2000
33 Automata arrays and context-free languages Kutrib, Martin   1999   9907 / 1999
34 Iterative arrays with small time bounds Buchholz, Thomas et al.   1999   9906 / 1999
35 Iterative arrays with a wee bit alternation Buchholz, Thomas et al.   1999   9905 / 1999
36 Real-time language recognition by alternating cellular automata Buchholz, Thomas et al.   1999   9904 / 1999
37 Probalistic logic programming under maximum entropy Lukasiewicz, Thomas et al.   1999   9903 / 1999
38 On tally languages and generalized interacting automata Buchholz, Thomas et al.   1999   9902 / 1999
39 Iterative arrays with limited nondeterministic communication cell Buchholz, Thomas et al.   1999   9901 / 1999
40 Probalistic and truth-functional many-valued logic programming Lukasiewicz, Thomas   1998   9809 / 1998
41 Preferred answer sets for extended logic programs Brewka, Gerd et al.   1998   9807 / 1998
42 On interacting automata with limited nondeterminism Buchholz, Thomas et al.   1998   9806 / 1998
43 A first-order representation of stable models Eiter, Thomas et al.   1998   9805 / 1998
44 Decision lists and related Boolean functions Eiter, Thomas et al.   1998   9804 / 1998
45 Computing intersections of Horn theories for reasoning with models Eiter, Thomas et al.   1998   9803 / 1998
46 Heterogeneous active agents Eiter, Thomas et al.   1998   9802 / 1998
47 One guess one-way cellular arrays Buchholz, Thomas et al.   1998   9801 / 1998
48 On time reduction and simulation in cellular spaces Buchholz, Thomas et al.   1998   9703 / 1998
49 Existential second-order logic over strings Eiter, Thomas et al.   1997   9702 / 1997
50 Enhancing symbolic model checking by AI techniques Buccafurri, Francesco et al.   1997   9701 / 1997