Giessener Elektronische Bibliothek

Schriftenreihe: IFIG Research Report

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