Markus Holzer

Markus Holzer, Sebastian Jakobi: Nondeterministic Biautomata and Their Descriptional Complexity. DCFS 2013: 112-123

Niraj Aswani, Thomas Beckers, Erich Birngruber, Célia Boyer, Andreas Burner, Jakub Bystron, Khalid Choukri, Sarah Cruchet, Hamish Cunningham, Jan Dedek, Ljiljana Dolamic, René Donner, Sebastian Dungs, Ivan Eggel, Antonio Foncubierta-Rodriguez, Norbert Fuhr, Adam Funk, Alba Garcia Seco de Herrera, Arnaud Gaudinat, Georgi Georgiev, Julien Gobeill, Lorraine Goeuriot, Paz Gomez, R. Mark Greenwood, Manfred Gschwandtner, Allan Hanbury, Jan Hajic, Jaroslava Hlavácová, Markus Holzer, Gareth J. F. Jones, Blanca Jordan, Matthias Jordan, Klemens Kaderk, Franz Kainberger, Liadh Kelly, Sascha Kriewel, Marlene Kritz, Georg Langs, Nolan Lawson, Dimitrios Markonis, Iván Martínez, Vassil Momtchev, Alexandre Masselot, Hélène Mazo, Henning Müller, João Palotti, Pavel Pecina, Konstantin Pentchev, Deyan Peychev, Natalia Pletneva, Diana Pottecher, Angus Roberts, Patrick Ruch, Alexander Sachs, Matthias Samwald, Priscille Schneller, Veronika Stefanov, Miguel Angel Tinte, Zdenka Uresová, Alejandro Vargas, Dina Vishnyakova: Khresmoi - Multilingual Semantic Search of Medical Text and Images. MedInfo 2013: 1266

Markus Holzer, Sebastian Jakobi: Minimization and characterizations for biautomata. NCMA 2013: 179-193

Markus Holzer, Sebastian Jakobi: Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). CIAA 2013: 181-192

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

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: 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

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, 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

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

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

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

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

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

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 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 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

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

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

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: Inductive Counting Below LOGSPACE. MFCS 1994: 276-285

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