Markus Holzer

Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. 23(1): 115-131 (2012)

Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano: Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO - Theor. Inf. and Applic. 46(4): 459-460 (2012)

Markus Holzer, Martin Kutrib, Giovanni Pighizzini: Preface. Theor. Comput. Sci. 449: 1 (2012)

Markus Holzer, Martin Kutrib, Katja Meckel: Nondeterministic state complexity of star-free languages. Theor. Comput. Sci. 450: 68-80 (2012)

Markus Holzer: A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems. Languages Alive 2012: 86-98

Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini: On Inverse Operations and Their Descriptional Complexity. DCFS 2012: 89-102

Markus Holzer, Sebastian Jakobi: State Complexity of Chop Operations on Unary and Finite Languages. DCFS 2012: 169-182

Markus Holzer, Sebastian Jakobi, Ian McQuillan: Generalized Derivations with Synchronized Context-Free Grammars. Developments in Language Theory 2012: 109-120

Markus Holzer, Sebastian Jakobi: From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract). Developments in Language Theory 2012: 190-201

Jakob Engel, Markus Holzer, Oliver Ruepp, Frank Sehnke: On Computer Integrated Rationalized Crossword Puzzle Manufacturing. FUN 2012: 131-141

Markus Holzer, Sebastian Jakobi: On the Complexity of Rolling Block and Alice Mazes. FUN 2012: 210-222

Markus Holzer, Sebastian Jakobi: Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes. FUN 2012: 223-234

Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher: Input-Driven Stack Automata. IFIP TCS 2012: 28-42

Rudolf Freund, Markus Holzer, Bianca Truthe, Ulrich Ultes-Nitsche (Eds.): Fourth Workshop on Non-Classical Models for Automata and Applications - NCMA 2012, Fribourg, Switzerland, August 23-24, 2012. Proceedings. books@ocg.at 290, Österreichische Computer Gesellschaft 2012, isbn 978-3-85403-290-8

Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp: Computational Complexity of NURIKABE. Fundam. Inform. 110(1-4): 159-174 (2011)

Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3) (2011)

Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011)

Markus Holzer, Martin Kutrib: Descriptional and computational complexity of finite automata - A survey. Inf. Comput. 209(3): 456-470 (2011)

Markus Holzer, Martin Kutrib: The Complexity of Regular(-like) Expressions. Int. J. Found. Comput. Sci. 22(7): 1533-1548 (2011)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Journal of Automata, Languages and Combinatorics 16(2-4): 91-107 (2011)

Markus Holzer, Martin Kutrib, Andreas Malcher: Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011)

Felix Brandt, Felix A. Fischer, Markus Holzer: Equilibria of graphical games with symmetries. Theor. Comput. Sci. 412(8-10): 675-685 (2011)

Martin Beaudry, Markus Holzer: On the size of inverse semigroups given by generators. Theor. Comput. Sci. 412(8-10): 765-772 (2011)

Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Chop of Languages. AFL 2011: 197-210

Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil: Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence. Computation, Cooperation, and Life 2011: 70-89

Markus Holzer, Sebastian Jakobi: Chop Operations and Expressions: Descriptional Complexity Considerations. Developments in Language Theory 2011: 264-275

Markus Holzer, Martin Kutrib, Ursula Leiter: Nodes Connected by Path Languages. Developments in Language Theory 2011: 276-287

Sebastian Haas, Rene Donner, Andreas Burner, Markus Holzer, Georg Langs: Superpixel-Based Interest Points for Effective Bags of Visual Words Medical Image Retrieval. MCBR-CDS 2011: 58-68

Andreas Burner, Rene Donner, Marius Mayerhoefer, Markus Holzer, Franz Kainberger, Georg Langs: Texture Bags: Anomaly Retrieval in Medical Images Based on Local 3D-Texture Similarity. MCBR-CDS 2011: 116-127

René Donner, Sebastian Haas, Andreas Burner, Markus Holzer, Horst Bischof, Georg Langs: Evaluation of Fast 2D and 3D Medical Image Retrieval Approaches Based on Image Miniatures. MCBR-CDS 2011: 128-138

Markus Holzer, Martin Kutrib: Gaining Power by Input Operations: Finite Automata and Beyond. CIAA 2011: 16-29

Markus Holzer, Martin Kutrib, Katja Meckel: Nondeterministic State Complexity of Star-Free Languages. CIAA 2011: 178-189

Markus Holzer, Martin Kutrib, Giovanni Pighizzini (Eds.): Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Lecture Notes in Computer Science 6808, Springer 2011, isbn 978-3-642-22599-4

Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano (Eds.): Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings. books@ocg.at 282, Austrian Computer Society 2011, isbn 978-3-85403-282-3

Henning Bordihn, Jürgen Dassow, Markus Holzer: Extending regular expressions with homomorphic replacement. RAIRO - Theor. Inf. and Applic. 44(2): 229-255 (2010)

Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-recursive Trade-Offs. Journal of Automata, Languages and Combinatorics 15(1/2): 107-120 (2010)

Markus Holzer, Andreas Maletti: An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411(38-39): 3404-3413 (2010)

Markus Holzer, Martin Kutrib: The Complexity of Regular(-Like) Expressions. Developments in Language Theory 2010: 16-30

Markus Holzer, Pierre McKenzie: The Computational Complexity of RaceTrack. FUN 2010: 260-271

Oliver Ruepp, Markus Holzer: The Computational Complexity of the Kakuro Puzzle, Revisited. FUN 2010: 319-330

Markus Holzer, Frank Schumacher, Thomas Greiner, Wolfgang Rosenstiel: Shape independent VLSI-architecture design approach for 2D morphological operations with non-flat structuring elements. ICECS 2010: 579-582

Markus Holzer, Martin Kutrib: Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Int. Conf. on Membrane Computing 2010: 19-36

Markus Holzer, Martin Kutrib: Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP 2010: 1-23

Markus Holzer, Ruben Bartholomä, Thomas Greiner, Wolfgang Rosenstiel: Orthogonal shift level comparison reuse for structuring element shape independent VLSI-Architectures of 2D morphological operations. SoCC 2010: 113-118

Felix Brandt, Felix A. Fischer, Markus Holzer: On Iterated Dominance, Matrix Elimination, and Matched Paths. STACS 2010: 107-118

Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Magic Number Problem for Subregular Language Families. DCFS 2010: 110-119

Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto (Eds.): Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings. books@ocg.at 263, Austrian Computer Society 2010, isbn 978-3-85403-263-2

Felix Brandt, Felix A. Fischer, Markus Holzer: On Iterated Dominance, Matrix Elimination, and Matched Paths. CoRR abs/1001.0529 (2010)

Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Inform. 91(1): 105-121 (2009)

Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009)

Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. Int. J. Found. Comput. Sci. 20(4): 563-580 (2009)

Felix Brandt, Felix A. Fischer, Markus Holzer: Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci. 75(3): 163-177 (2009)

Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009)

Hermann Gruber, Markus Holzer: Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410(35): 3281-3289 (2009)

Franziska Biegler, Mark Daley, Markus Holzer, Ian McQuillan: On the uniqueness of shuffle on words and finite languages. Theor. Comput. Sci. 410(38-40): 3711-3724 (2009)

Hermann Gruber, Markus Holzer: Tight Bounds on the Descriptional Complexity of Regular Expressions. Developments in Language Theory 2009: 276-287

Markus Holzer, Martin Kutrib: Descriptional and Computational Complexity of Finite Automata. LATA 2009: 23-42

Henning Bordihn, Markus Holzer, Martin Kutrib: Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246

Markus Holzer, Andreas Maletti: An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. CIAA 2009: 4-13

Hermann Gruber, Markus Holzer, Michael Tautschnig: Short Regular Expressions from Finite Automata: Empirical Results. CIAA 2009: 188-197

Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-Recursive Trade-Offs. DCFS 2009: 141-150

Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto (Eds.): Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings. books@ocg.at 256, Austrian Computer Society 2009, isbn 978-3-85403-256-4

Henning Bordihn, Markus Holzer: A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008)

Henning Bordihn, Markus Holzer, Martin Kutrib: State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96

Hermann Gruber, Markus Holzer: Language Operations with Regular Expressions of Polynomial Size. DCFS 2008: 182-193

Hermann Gruber, Markus Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. Developments in Language Theory 2008: 383-395

Hermann Gruber, Markus Holzer: Finite Automata, Digraph Connectivity, and Regular Expression Size. ICALP (2) 2008: 39-50

Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124

Henning Bordihn, Markus Holzer: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136

Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA 2008: 1-16

Felix Brandt, Felix A. Fischer, Markus Holzer: Equilibria of Graphical Games with Symmetries. WINE 2008: 198-209

Markus Holzer, Martin Kutrib, Andreas Malcher: Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. CSP 2008: 93-107

Felix Brandt, Felix A. Fischer, Markus Holzer: On Iterated Dominance, Matrix Elimination, and Matched Paths. Electronic Colloquium on Computational Complexity (ECCC) 15(077) (2008)

Martin Beaudry, Markus Holzer: The Complexity of Tensor Circuit Evaluation. Computational Complexity 16(1): 60-111 (2007)

Henning Bordihn, Markus Holzer: Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Inform. 76(3): 255-270 (2007)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007)

Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, György Vaszil, Markus Holzer: On Competence in CD Grammar Systems with Parallel Rewriting. Int. J. Found. Comput. Sci. 18(6): 1425-1439 (2007)

Markus Holzer, Martin Kutrib, Jens Reimann: Non-Recursive Trade-Offs for Deterministic Restarting Automata. Journal of Automata, Languages and Combinatorics 12(1-2): 195-213 (2007)

Hermann Gruber, Markus Holzer: On the average state and transition complexity of finite languages. Theor. Comput. Sci. 387(2): 155-166 (2007)

Hermann Gruber, Markus Holzer, Martin Kutrib: The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007)

Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Developments in Language Theory 2007: 108-119

Hermann Gruber, Markus Holzer: Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Developments in Language Theory 2007: 205-216

Hermann Gruber, Markus Holzer, Oliver Ruepp: Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. FUN 2007: 183-197

Markus Holzer, Oliver Ruepp: The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. FUN 2007: 198-212

Hermann Gruber, Markus Holzer: Computational Complexity of NFA Minimization for Finite and Unary Languages. LATA 2007: 261-272

Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204

Felix Brandt, Felix A. Fischer, Markus Holzer: Symmetries and the Complexity of Pure Nash Equilibrium. STACS 2007: 212-223

Felix Brandt, Felix A. Fischer, Markus Holzer: Equilibria of Graphical Games with Symmetries. Electronic Colloquium on Computational Complexity (ECCC) 14(136) (2007)

Henning Bordihn, Markus Holzer: Programmed grammars and their relation to the LBA problem. Acta Inf. 43(4): 223-242 (2006)

Markus Holzer, Martin Kutrib: Variable Complexity of Simple Programs. Fundam. Inform. 74(4): 511-528 (2006)

Erzsébet Csuhaj-Varjú, Jürgen Dassow, Markus Holzer: CD grammar systems with competence based entry conditions in their cooperation protocols. Int. J. Comput. Math. 83(2): 159-169 (2006)

Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Inf. Process. Lett. 99(6): 239-245 (2006)

Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide: Iterated sequential transducers as language generating devices. Theor. Comput. Sci. 369(1-3): 67-81 (2006)

Markus Holzer, Martin Kutrib: The Size of Higman-Haines Sets. DCFS 2006: 177-187

Hermann Gruber, Markus Holzer: Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS 2006: 267-275

Hermann Gruber, Markus Holzer: Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Developments in Language Theory 2006: 363-374

Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. CIAA 2006: 34-45

Hermann Gruber, Markus Holzer: Finding Lower Bounds for Nondeterministic State Complexity is Hard. Electronic Colloquium on Computational Complexity (ECCC) 13(027) (2006)

Felix Brandt, Felix A. Fischer, Markus Holzer: Symmetries and the Complexity of Pure Nash Equilibrium. Electronic Colloquium on Computational Complexity (ECCC) 13(091) (2006)

Henning Fernau, Rudolf Freund, Markus Holzer: Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Inform. 64(1-4): 159-170 (2005)

Henning Bordihn, Markus Holzer, Martin Kutrib: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16(3): 423-440 (2005)

Jürgen Dassow, Markus Holzer: Language families defined by a ciliate bio-operation: hierarchies and decision problems. Int. J. Found. Comput. Sci. 16(4): 645-662 (2005)

Markus Holzer, Martin Kutrib: On the descriptional complexity of finite automata with modified acceptance conditions. Theor. Comput. Sci. 330(2): 267-285 (2005)

Martin Beaudry, José M. Fernandez, Markus Holzer: A common algebraic description for probabilistic and quantum computations^, . Theor. Comput. Sci. 345(2-3): 206-234 (2005)

Markus Holzer, Martin Kutrib, Jens Reimann: Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169

Henning Bordihn, Markus Holzer, Martin Kutrib: Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179

Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König: On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. Developments in Language Theory 2005: 272-283

Markus Holzer, Friedrich Otto: Shrinking Multi-pushdown Automata. FCT 2005: 305-316

Markus Holzer, Waltraud Holzer: Tantrix^TM rotation puzzles are intractable. Discrete Applied Mathematics 144(3): 345-358 (2004)

Markus Holzer, Barbara König: Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory). Bulletin of the EATCS 83: 139-155 (2004)

Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Description for Basic Constructions on Rational Transductions. Journal of Automata, Languages and Combinatorics 9(2/3): 175-188 (2004)

Markus Holzer, Stefan Schwoon: Assembling molecules in ATOMIX is hard. Theor. Comput. Sci. 303(3): 447-462 (2004)

Markus Holzer, Barbara König: On deterministic finite automata and syntactic monoid size. Theor. Comput. Sci. 327(3): 319-347 (2004)

Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil: On Competence in CD Grammar Systems. Developments in Language Theory 2004: 76-88

Henning Bordihn, Markus Holzer, Martin Kutrib: Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. Developments in Language Theory 2004: 102-113

Markus Holzer, Martin Kutrib: Register Complexity of LOOP-, WHILE-, and GOTO-Programs. MCU 2004: 233-244

Martin Beaudry, José M. Fernandez, Markus Holzer: A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). MFCS 2004: 851-862

Markus Holzer, Stefan Katzenbeisser, Christian Schallhart: Towards Formal Semantics for ODRL. ODRL Workshop 2004: 137-148

Henning Bordihn, Markus Holzer, Martin Kutrib: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79

Markus Holzer, Martin Kutrib: Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. 14(6): 1087-1102 (2003)

Markus Holzer, Pierre McKenzie: Alternating and empty alternating auxiliary stack automata. Theor. Comput. Sci. 1-3(299): 307-326 (2003)

Henning Fernau, Markus Holzer, Rudolf Freund: Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. Theor. Comput. Sci. 1-3(299): 633-662 (2003)

Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto: McNaughton families of languages. Theor. Comput. Sci. 290(3): 1581-1628 (2003)

Henning Bordihn, Henning Fernau, Markus Holzer: On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130

Markus Holzer: On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions. DCFS 2003: 26-41

Markus Holzer, Barbara König: On Deterministic Finite Automata and Syntactic Monoid Size, Continued. Developments in Language Theory 2003: 349-360

Markus Holzer, Martin Kutrib: Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory 2003: 361-372

Markus Holzer, Martin Kutrib: Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. ICALP 2003: 490-501

Carsten Damm, Markus Holzer, Pierre McKenzie: The complexity of tensor calculus. Computational Complexity 11(1-2): 54-89 (2002)

Henning Fernau, Markus Holzer: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. Journal of Automata, Languages and Combinatorics 7(4): 487-503 (2002)

Henning Bordihn, Markus Holzer: On the Computational Complexity of Synchronized Context-Free Languages. J. UCS 8(2): 119-140 (2002)

Markus Holzer: Multi-head finite automata: data-independent versus data-dependent computations. Theor. Comput. Sci. 286(1): 97-116 (2002)

Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69

Markus Holzer, Martin Kutrib: Unary Language Operations and Their Nondeterministic State Complexity. Developments in Language Theory 2002: 162-172

Markus Holzer, Barbara König: On Deterministic Finite Automata and Syntactic Monoid Size. Developments in Language Theory 2002: 258-269

Markus Holzer, Martin Kutrib: State Complexity of Basic Operations on Nondeterministic Finite Automata. CIAA 2002: 148-157

Henning Bordihn, Markus Holzer: On the Number of Active Symbols in L and CD Grammar Systems. Journal of Automata, Languages and Combinatorics 6(4): 411-426 (2001)

Markus Holzer, Kai Salomaa, Sheng Yu: On the State Complexity of k-Entry Deterministic Finite Automata. Journal of Automata, Languages and Combinatorics 6(4): 453-466 (2001)

Henning Fernau, Markus Holzer, Rudolf Freund: Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1-2): 405-426 (2001)

Henning Fernau, Markus Holzer: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. DCFS 2001: 79-90

Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto: On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. Developments in Language Theory 2001: 340-348

Martin Beaudry, Markus Holzer: The Complexity of Tensor Circuit Evaluation. MFCS 2001: 173-185

Markus Holzer, Martin Kutrib: Improving Raster Image Run-Length Encoding Using Data Order. CIAA 2001: 161-176

Henning Bordihn, Markus Holzer: Grammar Systems with Negated Conditions in their Cooperation Protocols. J. UCS 6(12): 1165-1184 (2000)

Henning Fernau, Markus Holzer: External Contextual and Conditional Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 104-120

Carsten Damm, Markus Holzer, Pierre McKenzie: The Complexity of Tensor Calculus. IEEE Conference on Computational Complexity 2000: 70-86

Markus Holzer, Pierre McKenzie: Alternating and Empty Alternating Auxiliary Stack Automata. MFCS 2000: 415-425

Carsten Damm, Markus Holzer, Pierre McKenzie: The Complexity of Tensor Calculus. Electronic Colloquium on Computational Complexity (ECCC) 7(36) (2000)

Henning Bordihn, Henning Fernau, Markus Holzer: On Accepting Pure Lindenmayer Systems. Fundam. Inform. 38(4): 365-375 (1999)

Henning Bordihn, Markus Holzer: On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69(2): 59-62 (1999)

Henning Bordihn, Markus Holzer: Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315

Markus Holzer: On fixed and general membership for external and internal contextual languages. Developments in Language Theory 1999: 351-361

Henning Fernau, Rudolf Freund, Markus Holzer: Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. Grammatical Models of Multi-Agent Systems 1999: 157-181

Henning Fernau, Rudolf Freund, Markus Holzer: Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. Grammatical Models of Multi-Agent Systems 1999: 284-296

Markus Holzer, Muriel Quenzer: VisA: towards a students' green card to automata theory and formal languages. ACSE 1998: 67-75

Markus Holzer, Muriel Quenzer: VisA: A Tool for Visualizing and Animating Automata and Formal Languages. Graph Drawing 1998: 450-451

Henning Fernau, Rudolf Freund, Markus Holzer: The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56

Henning Fernau, Rudolf Freund, Markus Holzer: Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291

Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997)

Henning Fernau, Markus Holzer: Conditional Context-Free Languages of Finite Index. New Trends in Formal Languages 1997: 10-26

Markus Holzer, Klaus-Jörn Lange: On the Complexity of Iterated Insertions. New Trends in Formal Languages 1997: 440-453

Henning Fernau, Markus Holzer, Rudolf Freund: Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory 1997: 261-272

Markus Holzer: Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. MFCS 1997: 299-308

Henning Fernau, Markus Holzer: Accepting Multi-Agent Systems II. Acta Cybern. 12(4): 361-380 (1996)

Henning Fernau, Markus Holzer, Henning Bordihn: Accepting Multi-Agent Systems. Computers and Artificial Intelligence 15(2-3) (1996)

Carsten Damm, Markus Holzer: Inductive Counting for Width-Restricted Branching Programs. Inf. Comput. 130(1): 91-99 (1996)

Markus Holzer: On Emptiness and Counting for Alternating Finite Automata. Developments in Language Theory 1995: 88-97

Carsten Damm, Markus Holzer: Automata That Take Advice. MFCS 1995: 149-158

Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-01 (1995)

Carsten Damm, Markus Holzer: Inductive Counting Below LOGSPACE. MFCS 1994: 276-285

Carsten Damm, Markus Holzer: Inductive Counting below LOGSPACE. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-12 (1994)

Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith: Deterministic OL Languages are of Very Low Complexity: DOL is in AC⁰. Developments in Language Theory 1993: 305-313

Markus Holzer, Klaus-Jörn Lange: On the Complexities of Linear LL(1) and LR(1) Grammars. FCT 1993: 299-308

Carsten Damm, Markus Holzer, Klaus-Jörn Lange: Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS 1992: 227-235