Markus Holzer

发表

Non-Recursive Trade-Offs for Deterministic Restarting Automata

Martin Kutrib, Markus Holzer, Jens Reimann, 2007, J. Autom. Lang. Comb..

Tight Bounds on the Descriptional Complexity of Regular Expressions

Markus Holzer, Hermann Gruber, M. Holzer, 2009, Developments in Language Theory.

The Complexity of Regular(-like) Expressions

Martin Kutrib, Markus Holzer, M. Holzer, 2010, Int. J. Found. Comput. Sci..

One-Time Nondeterministic Computations

Martin Kutrib, Markus Holzer, 2019, Int. J. Found. Comput. Sci..

Revolving-Input Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2005, Developments in Language Theory.

Provably Shorter Regular Expressions from Finite Automata

Markus Holzer, Hermann Gruber, M. Holzer, 2013, Int. J. Found. Comput. Sci..

On Measuring Non-recursive Trade-Offs

Martin Kutrib, Markus Holzer, Hermann Gruber, 2009, J. Autom. Lang. Comb..

Hybrid Extended Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2007, Int. J. Found. Comput. Sci..

PushPush-k is PSPACE-Complete

Erik D. Demaine, Markus Holzer, Michael Hoffmann, 2004 .

Tight Bounds for Cut-Operations on Deterministic Finite Automata

Brink van der Merwe, Markus Holzer, Sebastian Jakobi, 2017, Fundam. Informaticae.

A mesh of automata

Nelma Moreira, Rogério Reis, Markus Holzer, 2019, Inf. Comput..

Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity

Martin Kutrib, Markus Holzer, 2008, CIAA.

On the State Complexity of k-Entry Deterministic Finite Automata

Sheng Yu, Markus Holzer, Kai Salomaa, 2001, J. Autom. Lang. Comb..

VisA: towards a students' green card to automata theory and formal languages

Markus Holzer, Muriel Quenzer, 1998, ACSE '98.

External Contextual and Conditional Languages

Henning Fernau, Markus Holzer, 2000, Recent Topics in Mathematical and Computational Linguistics.

Operational State Complexity and Decidability of Jumping Finite Automata

Martin Kutrib, Markus Holzer, Simon Beier, 2017, DLT.

Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms

Markus Holzer, Hermann Gruber, Oliver Ruepp, 2007, FUN.

On bonded sequential and parallel insertion systems

Sherzod Turaev, Bianca Truthe, Markus Holzer, 2018, RAIRO Theor. Informatics Appl..

Tight Bounds for Cut-Operations on Deterministic Finite Automata

Brink van der Merwe, Markus Holzer, Sebastian Jakobi, 2015, MCU.

Reversible Nondeterministic Finite Automata

Martin Kutrib, Markus Holzer, 2017, RC.

The chop of languages

Martin Kutrib, Markus Holzer, Sebastian Jakobi, 2017, Theor. Comput. Sci..

Language families defined by a ciliate bio-operation: hierarchies and decision problems

Jürgen Dassow, Markus Holzer, 2005, Int. J. Found. Comput. Sci..

On the Computational Complexity of Problems Related to Distinguishability Sets

Markus Holzer, Sebastian Jakobi, M. Holzer, 2015, DCFS.

On the size of inverse semigroups given by generators

Markus Holzer, Martin Beaudry, 2011, Theor. Comput. Sci..

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

Martin Kutrib, Andreas Malcher, Markus Holzer, 2009, CSP.

A common algebraic description for probabilistic and quantum computations,

Markus Holzer, José M. Fernandez, Martin Beaudry, 2005, Theor. Comput. Sci..

Language Operations with Regular Expressions of Polynomial Size

Markus Holzer, Hermann Gruber, 2008, DCFS.

On fixed and general membership for external and internal contextual languages

Markus Holzer, M. Holzer, 2000, Developments in Language Theory.

Minimization and Characterizations for Biautomata

Markus Holzer, Sebastian Jakobi, 2013, Fundam. Informaticae.

On the computational complexity of problems related to distinguishability sets

Markus Holzer, Sebastian Jakobi, 2018, Inf. Comput..

State complexity of basic operations on nondeterministic finite automata

Martin Kutrib, Markus Holzer, M. Holzer, 2002, CIAA'02.

On the Computational Complexity of Partial Word Automata Problems

Markus Holzer, Matthias Wendlandt, Sebastian Jakobi, 2016, Fundam. Informaticae.

On Regular Expression Proof Complexity

Markus Holzer, Simon Beier, 2017, DLT.

More on deterministic and nondeterministic finite cover automata

Markus Holzer, Hermann Gruber, Sebastian Jakobi, 2017, Theor. Comput. Sci..

The Magic Number Problem for Subregular Language Families

Martin Kutrib, Markus Holzer, Sebastian Jakobi, 2012, Int. J. Found. Comput. Sci..

More Structural Characterizations of Some Subregular Language Families by Biautomata

Markus Holzer, Sebastian Jakobi, M. Holzer, 2014, AFL.

One-Time Nondeterministic Computations

Martin Kutrib, Markus Holzer, M. Holzer, 2017, DCFS.

The Complexity of Tensor Circuit Evaluation

Markus Holzer, Martin Beaudry, 2001, MFCS.

Descriptional Complexity - An Introductory Survey

Martin Kutrib, Markus Holzer, M. Holzer, 2010, Scientific Applications of Language Methods.

Properties of Right One-Way Jumping Finite Automata

Markus Holzer, Simon Beier, 2018, DCFS.

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems

Markus Holzer, Henning Bordihn, M. Holzer, 2008, LATA.

Preface

Rudolf Freund, Martin Kutrib, Friedrich Otto, 2011, Fundam. Informaticae.

On relations between some subregular language families

Bianca Truthe, Markus Holzer, 2015, NCMA.

Multi-head finite automata: data-independent versus data-dependent computations

Markus Holzer, 2002, Theor. Comput. Sci..

On Computer Integrated Rationalized Crossword Puzzle Manufacturing

Frank Sehnke, Markus Holzer, Oliver Ruepp, 2012, FUN.

Bounding resources in Cooperating Distributed Grammar Systems

Rudolf Freund, Henning Fernau, Markus Holzer, 1997, Developments in Language Theory.

The Ranges of Accepting State Complexities of Languages Resulting From Some Operations

Markus Holzer, Michal Hospodár, M. Holzer, 2018, CIAA.

ω-rational Languages: High Complexity Classes vs. Borel Hierarchy

Martin Kutrib, Markus Holzer, Enrico Formenti, 2014, LATA.

The complexity of tensor calculus

Pierre McKenzie, Markus Holzer, Carsten Damm, 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

CD grammar systems with competence based entry conditions in their cooperation protocols

Erzsébet Csuhaj-Varjú, Jürgen Dassow, Markus Holzer, 2006, Int. J. Comput. Math..

On Competence in CD Grammar Systems with Parallel Rewriting

Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil, 2007, Int. J. Found. Comput. Sci..

From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity

Markus Holzer, Hermann Gruber, M. Holzer, 2014, Int. J. Found. Comput. Sci..

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations

Rudolf Freund, Henning Fernau, Markus Holzer, 1999, Grammatical Models of Multi-Agent Systems.

The Magic Number Problem for Subregular Language Families

Martin Kutrib, Markus Holzer, Sebastian Jakobi, 2010, DCFS.

Decidability of operation problems for T0L languages and subclasses

Martin Kutrib, Markus Holzer, Henning Bordihn, 2011, Inf. Comput..

Expressing uniformity via oracles

Markus Holzer, Carsten Damm, Peter Rossmanith, 2007, Theory of Computing Systems.

Conditional Context-Free Languages of Finite Index

Henning Fernau, Markus Holzer, 1997, New Trends in Formal Languages.

Nondeterministic Descriptional Complexity Of Regular Languages

Martin Kutrib, Markus Holzer, 2003, Int. J. Found. Comput. Sci..

More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract

Markus Holzer, Hermann Gruber, Sebastian Jakobi, 2015, CIAA.

On the Grammatical Complexity of Finite Languages

Markus Holzer, Simon Wolfsteiner, 2018, DCFS.

A comment on strong language families and self-verifying complexity classes

Markus Holzer, Sebastian Jakobi, 2019, NCMA.

Assembling molecules in ATOMIX is hard

Markus Holzer, Stefan Schwoon, 2004, Theor. Comput. Sci..

A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems

Markus Holzer, M. Holzer, 2012, Languages Alive.

Input-Driven Double-Head Pushdown Automata

Martin Kutrib, Andreas Malcher, Markus Holzer, 2017, AFL.

Generalized Derivations with Synchronized Context-Free Grammars

Markus Holzer, Ian McQuillan, Sebastian Jakobi, 2012, Developments in Language Theory.

The Degree of Irreversibility in Deterministic Finite Automata

Martin Kutrib, Markus Holzer, Holger Bock Axelsen, 2017, Int. J. Found. Comput. Sci..

Minimal Reversible Deterministic Finite Automata

Martin Kutrib, Markus Holzer, Sebastian Jakobi, 2015, DLT.

On the Complexity of Rolling Block and Alice Mazes

Markus Holzer, Sebastian Jakobi, 2012, FUN.

Shrinking Multi-pushdown Automata

Friedrich Otto, Markus Holzer, 2005, FCT.

Improving Raster Image Run-Length Encoding Using Data Order

Martin Kutrib, Markus Holzer, 2001, CIAA.

Preface

Bianca Truthe, Markus Holzer, M. Holzer, 2014, RAIRO Theor. Informatics Appl..

On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems

Markus Holzer, Henning Bordihn, M. Holzer, 1999, Inf. Process. Lett..

On the Number of Active Symbols in L and CD Grammar Systems

Markus Holzer, Henning Bordihn, 2001, J. Autom. Lang. Comb..

An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton

Andreas Maletti, Markus Holzer, 2010, Theor. Comput. Sci..

On Inverse Operations and Their Descriptional Complexity

Carlo Mereghetti, Beatrice Palano, Markus Holzer, 2012, DCFS.

The size of Higman-Haines sets

Martin Kutrib, Markus Holzer, Hermann Gruber, 2007, Theor. Comput. Sci..

Hybrid Extended Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2006, CIAA.

The Degree of Irreversibility in Deterministic Finite Automata

Martin Kutrib, Markus Holzer, Holger Bock Axelsen, 2016, CIAA.

McNaughton families of languages

Friedrich Otto, Markus Holzer, Martin Beaudry, 2003, Theor. Comput. Sci..

Economy of Descriptions for Basic Constructions on Rational Transductions

Martin Kutrib, Markus Holzer, Henning Bordihn, 2002, DCFS.

A note on cooperating distributed grammar systems working in combined modes

Markus Holzer, Henning Bordihn, M. Holzer, 2008, Inf. Process. Lett..

On the Number of Active States in Deterministic and Nondeterministic Finite Automata

Markus Holzer, Henning Bordihn, 2017, CIAA.

Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract)

Markus Holzer, Simon Beier, 2019, CIAA.

On deterministic finite automata and syntactic monoid size

Barbara König, Markus Holzer, B. König, 2003, Theor. Comput. Sci..

On Inverse Operations and Their Descriptional Complexity

Markus Holzer, Maria Paola Bianchi, Sebastian Jakobi, 2012, DCFS.

Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes

Markus Holzer, Sebastian Jakobi, 2012, FUN.

Computational Complexity of NURIKABE

Martin Kutrib, Markus Holzer, Andreas Klein, 2011, Fundam. Informaticae.

On the Complexities of Linear LL(1) and LR(1) Grammars

Markus Holzer, Klaus-Jörn Lange, M. Holzer, 1993, FCT.

On deterministic finite automata and syntactic monoid size

Barbara König, Markus Holzer, B. König, 2003, Theor. Comput. Sci..

Preface: Non-Classical Models of Automata and Applications VII

Nelma Moreira, Rogério Reis, Markus Holzer, 2016, RAIRO Theor. Informatics Appl..

On Iterated Sequential Transducers

Henning Fernau, Markus Holzer, Henning Bordihn, 2003, Grammars and Automata for String Processing.

Preface

Martin Kutrib, Markus Holzer, Giovanni Pighizzini, 1992, Theor. Comput. Sci..

Automata that may change their mind

Martin Kutrib, Markus Holzer, M. Holzer, 2018, NCMA.

More on Minimizing Finite Automata with Errors - Nondeterministic Machines

Markus Holzer, Sebastian Jakobi, 2017, Int. J. Found. Comput. Sci..

On the Descriptional Complexity of Operations on Semilinear Sets

Martin Kutrib, Markus Holzer, Simon Beier, 2017, AFL.

Hairpin Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2007, Developments in Language Theory.

Complexity of multi-head finite automata: Origins and directions

Martin Kutrib, Andreas Malcher, Markus Holzer, 2011, Theor. Comput. Sci..

Programmed grammars and their relation to the LBA problem

Markus Holzer, Henning Bordihn, 2006, Acta Informatica.

On the descriptional complexity of finite automata with modified acceptance conditions

Martin Kutrib, Markus Holzer, 2003, Theor. Comput. Sci..

Hairpin Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2007, Developments in Language Theory.

VisA: A Tool for Visualizing and Animating Automata and Formal Languages

Markus Holzer, Muriel Quenzer, 1998, Graph Drawing.

On deterministic finite automata and syntactic monoid size

Barbara König, Markus Holzer, 2004, Theor. Comput. Sci..

Self-Assembling Pushdown Automata

Martin Kutrib, Markus Holzer, M. Holzer, 2014, J. Autom. Lang. Comb..

Nondeterministic state complexity of star-free languages

Martin Kutrib, Katja Meckel, Markus Holzer, 2011, Theor. Comput. Sci..

Iterated sequential transducers as language generating devices

Henning Fernau, Carlos Martín-Vide, Vincenzo Manca, 2006, Theor. Comput. Sci..

Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP

Markus Holzer, Hermann Gruber, M. Holzer, 2007, Developments in Language Theory.

Equilibria of Graphical Games with Symmetries

Felix A. Fischer, Felix Brandt, Markus Holzer, 2008, WINE.

Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers

Markus Holzer, Carsten Damm, Klaus-Jörn Lange, 1992, MFCS.

On Competence in CD Grammar Systems

Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil, 2004, Developments in Language Theory.

Symmetries and the complexity of pure Nash equilibrium

Felix A. Fischer, Felix Brandt, Markus Holzer, 2007, J. Comput. Syst. Sci..

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages

Martin Kutrib, Markus Holzer, Henning Bordihn, 2004, Developments in Language Theory.

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0

Markus Holzer, Carsten Damm, Peter Rossmanith, 1993, Developments in Language Theory.

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k

Martin Kutrib, Markus Holzer, 2003, ICALP.

More on the Size of Higman-Haines Sets: Effective Constructions

Martin Kutrib, Markus Holzer, Hermann Gruber, 2007, Fundam. Informaticae.

Nondeterministic Biautomata and Their Descriptional Complexity

Markus Holzer, Sebastian Jakobi, 2013, DCFS.

Minimal and Hyper-Minimal Biautomata - (Extended Abstract)

Markus Holzer, Sebastian Jakobi, 2014, Developments in Language Theory.

Equilibria of graphical games with symmetries

Felix A. Fischer, Felix Brandt, Markus Holzer, 2008, Theor. Comput. Sci..

Decidability of Right One-Way Jumping Finite Automata

Markus Holzer, Simon Beier, 2018, DLT.

Input-Driven Stack Automata

Martin Kutrib, Andreas Malcher, Markus Holzer, 2012, IFIP TCS.

Automaten und Formale Sprachen

Martin Kutrib, Andreas Malcher, Markus Holzer, 2008 .

Provably Shorter Regular Expressions from Deterministic Finite Automata

Markus Holzer, Hermann Gruber, 2008, Developments in Language Theory.

Descriptional Complexity of Deterministic Restarting Automata

Martin Kutrib, Markus Holzer, Jens Reimann, 2005, DCFS.

Finding Lower Bounds for Nondeterministic State Complexity Is Hard

Markus Holzer, Hermann Gruber, 2006, Developments in Language Theory.

The Complexity of Regular(-Like) Expressions

Martin Kutrib, Markus Holzer, 2010, Developments in Language Theory.

The Complexity of Tensor Circuit Evaluation

Markus Holzer, Martin Beaudry, M. Holzer, 2001, computational complexity.

On Accepting Pure Lindenmayer Systems

Henning Fernau, Markus Holzer, Henning Bordihn, 1999, Fundam. Informaticae.

The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria

Stefan Katzenbeisser, Felix A. Fischer, Markus Holzer, 2006, Inf. Process. Lett..

Minimal and Hyper-Minimal Biautomata

Markus Holzer, Sebastian Jakobi, 2016, Int. J. Found. Comput. Sci..

Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms

Markus Holzer, Jan-Tobias Maurer, 2018, FUN.

Nodes Connected by Path Languages

Martin Kutrib, Markus Holzer, Ursula Leiter, 2011, Developments in Language Theory.

Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction

Martin Kutrib, Markus Holzer, M. Holzer, 2010, Int. Conf. on Membrane Computing.

Short Regular Expressions from Finite Automata: Empirical Results

Markus Holzer, Hermann Gruber, Michael Tautschnig, 2009, CIAA.

Decidability of Right One-Way Jumping Finite Automata

Markus Holzer, Simon Beier, 2020, Int. J. Found. Comput. Sci..

Towards Formal Semantics for ODRL

Stefan Katzenbeisser, Markus Holzer, Christian Schallhart, 2004, ODRL Workshop.

Grammar Systems with Negated Conditions in their Cooperation Protocols

Markus Holzer, Henning Bordihn, M. Holzer, 2000, J. Univers. Comput. Sci..

Reversible Shrinking Two-Pushdown Automata

Martin Kutrib, Andreas Malcher, Markus Holzer, 2016, LATA.

The Range of State Complexities of Languages Resulting from the Cut Operation

Markus Holzer, Michal Hospodár, 2019, LATA.

Inductive Counting for Width-Restricted Branching Programs

Markus Holzer, Carsten Damm, 1996, Inf. Comput..

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes

Rudolf Freund, Henning Fernau, Markus Holzer, 2014, AFL.

Martin Kutrib, Markus Holzer, 2004, MCU.

Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition

Rudolf Freund, Henning Fernau, Markus Holzer, 1999, Grammatical Models of Multi-Agent Systems.

Deterministic Input-Reversal and Input-Revolving Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2008, LATA.

On the Computational Complexity of Synchronized Context-Free Languages

Markus Holzer, Henning Bordihn, 2002, J. Univers. Comput. Sci..

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism

Martin Kutrib, Markus Holzer, 2003, Developments in Language Theory.

Highly efficient lattice Boltzmann multiphase simulations of immiscible fluids at high-density ratios on CPUs and GPUs through code generation pdf

Martin Bauer, Markus Holzer, Ullrich Rüde, 2020, Int. J. High Perform. Comput. Appl..

Extending regular expressions with homomorphic replacement

Jürgen Dassow, Markus Holzer, Henning Bordihn, 2010, RAIRO Theor. Informatics Appl..

On the uniqueness of shuffle on words and finite languages

Mark Daley, Markus Holzer, Ian McQuillan, 2009, Theor. Comput. Sci..

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars

Rudolf Freund, Henning Fernau, Markus Holzer, 2005, Fundam. Informaticae.

The complexity of tensor calculus

Pierre McKenzie, Markus Holzer, Carsten Damm, 2002, computational complexity.

From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract)

Markus Holzer, Sebastian Jakobi, 2012, Developments in Language Theory.

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components

Henning Fernau, Markus Holzer, 2001, DCFS.

Determination of finite automata accepting subregular languages

Martin Kutrib, Markus Holzer, Henning Bordihn, 2009, Theor. Comput. Sci..

Editorial

Martin Kutrib, Bianca Truthe, Markus Holzer, 2016, J. Autom. Lang. Comb..

Character Recognition with k-Head Finite Array Automata

Rudolf Freund, Henning Fernau, Markus Holzer, 1998, SSPR/SPR.

The Generative Power of d-Dimensional #-Context-Free Array Grammars

Rudolf Freund, Henning Fernau, Markus Holzer, 1998, MCU.

On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization

Barbara König, Markus Holzer, Hermann Gruber, 2005, Developments in Language Theory.

Over-Segmentation of 3D Medical Image Volumes based on Monogenic Cues

Markus Holzer, René Donner, R. Donner, 2014 .

Alternating and empty alternating auxiliary stack automata

Pierre McKenzie, Markus Holzer, 2003, Theor. Comput. Sci..

Structure and Complexity of Some Subregular Language Families

Martin Kutrib, Markus Holzer, 2017, The Role of Theory in Computer Science.

More on the Size of Higman-Haines Sets: Effective Constructions

Martin Kutrib, Markus Holzer, Hermann Gruber, 2007, MCU.

On Minimizing Regular Expressions Without Kleene Star

Markus Holzer, Hermann Gruber, Simon Wolfsteiner, 2020, Electron. Colloquium Comput. Complex..

Accepting Multi-Agent Systems

Henning Fernau, Markus Holzer, Henning Bordihn, 1996, Comput. Artif. Intell..

Cooperating distributed grammar systems with non-terminating components

Markus Holzer, Henning Bordihn, 1999, Developments in Language Theory.

On the average state and transition complexity of finite languages

Markus Holzer, Hermann Gruber, M. Holzer, 2007, Theor. Comput. Sci..

On input-revolving deterministic and nondeterministic finite automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2009, Inf. Comput..

Computing with Foresight and Industry: 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings

Martin Kutrib, Markus Holzer, D. Paulusma, 2019, Lecture Notes in Computer Science.

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k

Rudolf Freund, Henning Fernau, Markus Holzer, 2003, Theor. Comput. Sci..

Descriptional and computational complexity of finite automata - A survey

Martin Kutrib, Markus Holzer, M. Holzer, 2011, Inf. Comput..

Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract)

Markus Holzer, Sebastian Jakobi, 2013, CIAA.

Descriptional Complexity of Chop Operations on Unary and Finite Languages

Markus Holzer, Sebastian Jakobi, 2012, J. Autom. Lang. Comb..

Alternating and Empty Alternating Auxiliary Stack Automata

Pierre McKenzie, Markus Holzer, 2000, MFCS.

State Complexity of Chop Operations on Unary and Finite Languages

Markus Holzer, Sebastian Jakobi, 2012, DCFS.

Computational Complexity of Decision Problems on Self-verifying Finite Automata

Markus Holzer, Jozef Jirásek, Sebastian Jakobi, 2018, DLT.

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)

Markus Holzer, Simon Beier, 2019, DCFS.

Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited

Markus Holzer, Henning Bordihn, M. Holzer, 2007, Fundam. Informaticae.

Preface

Martin Kutrib, Bianca Truthe, Markus Holzer, 2016, J. Autom. Lang. Comb..

Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory)

Barbara König, Markus Holzer, 2004, Bull. EATCS.

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization

Rudolf Freund, Henning Fernau, Markus Holzer, 2001, Theor. Comput. Sci..

Boundary Sets of Regular and Context-Free Languages

Markus Holzer, Sebastian Jakobi, 2014, DCFS.

Data-independent versus data-dependent computations on multi-head automata

Markus Holzer, 1998 .

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata

Martin Kutrib, Markus Holzer, 2010, RP.

Nondeterministic Biautomata and their Descriptional Complexity

Markus Holzer, Sebastian Jakobi, 2014, Int. J. Found. Comput. Sci..

The Computational Complexity of the Kakuro Puzzle, Revisited

Markus Holzer, Oliver Ruepp, M. Holzer, 2010, FUN.

Automata That Take Advice

Markus Holzer, Carsten Damm, 1995, MFCS.

Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations

Markus Holzer, 1997, MFCS.

Chop Operations and Expressions: Descriptional Complexity Considerations

Markus Holzer, Sebastian Jakobi, 2011, Developments in Language Theory.

Accepting Multi-Agent Systems II

Henning Fernau, Markus Holzer, H. Fernau, 1996, Acta Cybern..

Symmetries and the complexity of pure Nash equilibrium

Felix Brandt, Markus Holzer, Felix Fischer, 2009, J. Comput. Syst. Sci..

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

Andreas Maletti, Markus Holzer, 2009, CIAA.

Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence

Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil, 2011, Computation, Cooperation, and Life.

Preface

Martin Kutrib, Markus Holzer, M. Holzer, 2015, Int. J. Found. Comput. Sci..

The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems

Rudolf Freund, Henning Fernau, Markus Holzer, 2015, Int. J. Found. Comput. Sci..

Undecidability of Operation Problems for T0L Languages and Subclasses

Martin Kutrib, Markus Holzer, Henning Bordihn, 2009, LATA.

Descriptional and Computational Complexity of Finite Automata

Martin Kutrib, Markus Holzer, M. Holzer, 2009, LATA.

Nondeterministic state complexity of star-free languages

Martin Kutrib, Katja Meckel, Markus Holzer, 2012, Theor. Comput. Sci..

Unary Language Operations and Their Nondeterministic State Complexity

Martin Kutrib, Markus Holzer, M. Holzer, 2002, Developments in Language Theory.

Boundary sets of regular and context-free languages

Markus Holzer, Sebastian Jakobi, 2016, Theor. Comput. Sci..

A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract)

Markus Holzer, José M. Fernandez, Martin Beaudry, 2004, MFCS.

On the Complexity of Iterated Insertions

Markus Holzer, Klaus-Jörn Lange, 1997, New Trends in Formal Languages.

Computational Complexity of NFA Minimization for Finite and Unary Languages

Markus Holzer, Hermann Gruber, 2007, LATA.

Gaining Power by Input Operations: Finite Automata and Beyond

Martin Kutrib, Markus Holzer, M. Holzer, 2011, CIAA.

The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake

Markus Holzer, Oliver Ruepp, M. Holzer, 2007, FUN.

Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract)

Markus Holzer, Hermann Gruber, 2006, DCFS.

Expressing Uniformity via Oracles

Markus Holzer, Carsten Damm, Peter Rossmanith, 1997, Theory Comput. Syst..

TantrixTM rotation puzzles are intractable

Markus Holzer, Waltraud Holzer, 2004, Discret. Appl. Math..

Unsolvability levels of operation problems for subclasses of context-free languages

Martin Kutrib, Markus Holzer, Henning Bordihn, 2005, Int. J. Found. Comput. Sci..

Operational State Complexity and Decidability of Jumping Finite Automata

Martin Kutrib, Markus Holzer, Simon Beier, 2017, DLT.

The Computational Complexity of RaceTrack

Pierre McKenzie, Markus Holzer, 2010, FUN.

On the Mother of All Automata: The Position Automaton

Nelma Moreira, Rogério Reis, Markus Holzer, 2017, DLT.

On Iterated Dominance, Matrix Elimination, and Matched Paths

Felix A. Fischer, Felix Brandt, Markus Holzer, 2008, STACS.

Inductive Counting Below LOGSPACE

Markus Holzer, Carsten Damm, 1994, MFCS.

Computational Complexity of Synchronization under Regular Constraints

Henning Fernau, Markus Holzer, Vladimir V. Gusev, 2019, MFCS.

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages

Martin Kutrib, Markus Holzer, Henning Bordihn, 2004, CIAA.

Variable Complexity of Simple Programs

Martin Kutrib, Markus Holzer, 2006, Fundam. Informaticae.

State Complexity of NFA to DFA Conversion of Subregular Language Families

Martin Kutrib, Markus Holzer, Henning Bordihn, 2008, DCFS.

On Minimal Grammar Problems for Finite Languages

Markus Holzer, Hermann Gruber, Simon Wolfsteiner, 2018, DLT.

Finite Automata, Digraph Connectivity, and Regular Expression Size

Markus Holzer, Hermann Gruber, M. Holzer, 2008, ICALP.

Two-sided strictly locally testable languages

Martin Kutrib, Friedrich Otto, Markus Holzer, 2017, NCMA.

On Emptiness and Counting for Alternating Finite Automata

Markus Holzer, 1995, Developments in Language Theory.

Properties of right one-way jumping finite automata

Markus Holzer, Simon Beier, 2019, Theor. Comput. Sci..

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)

Rudolf Freund, Friedrich Otto, Carlo Mereghetti, 2012, RAIRO Theor. Informatics Appl..

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy

Friedrich Otto, Markus Holzer, Martin Beaudry, 2001, Developments in Language Theory.

The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract)

Markus Holzer, Christian Rauch, 2021, DLT.

On the number of active states in finite automata

Markus Holzer, Henning Bordihn, 2021, Acta Informatica.

Optimal Regular Expressions for Palindromes of Given Length

Markus Holzer, Hermann Gruber, 2021, MFCS.

Descriptional complexity of regular languages

Martin Kutrib, Markus Holzer, Hermann Gruber, 2021, Handbook of Automata Theory.

More on the Descriptional Complexity of Products of Finite Automata

Markus Holzer, Christian Rauch, 2021, DCFS.

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes

Henning Fernau, Markus Holzer, Mateus de Oliveira Oliveira, 2021, FSTTCS.

On the Computational Complexity of Reaction Systems, Revisited

Markus Holzer, Christian Rauch, 2021, CSR.

Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)

Markus Holzer, José M. Sempere, 2021, RAIRO Theor. Informatics Appl..

Nondeterministic right one-way jumping finite automata

Markus Holzer, Simon Beier, 2021 .

The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract)

Markus Holzer, Christian Rauch, 2021, CIAA.

Accepting Pure Grammars and Systems

Markus Holzer, 1999 .

Regulated Finite Index Language Families Collapse Regulated Finite Index Language Families Collapse

Henning Fernau, Markus Holzer, 1996 .

NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY

Martin Kutrib, Markus Holzer, M. Holzer, 2009 .

External versus Internal Hybridization for Cooperating Distributed Grammar Systems

Rudolf Freund, Markus Holzer, M. Holzer, 1996 .

On The NP-Completeness of The Nurikabe Pencil Puzzle and Variants Thereof

Martin Kutrib, Markus Holzer, M. Holzer, 2008 .