Markus Holzer

ORCID

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 80

Top Venues

Int. J. Found. Comput. Sci.

DCFS

CIAA

NCMA

University of Tübingen, Germany (PHD)

Education History

University of Tübingen, Germany

PHD

Publications

Christian Rauch, Markus Holzer
On the accepting state complexity of operations on permutation automata. RAIRO Theor. Informatics Appl. 57 (2023)
Markus Holzer, Christian Rauch
On Jaffe's Pumping Lemma, Revisited. DCFS (2023)
Markus Holzer, Christian Rauch
On Minimal Pumping Constants for Regular Languages. AFL (2023)
Hermann Gruber, Markus Holzer, Christian Rauch
The Pumping Lemma for Regular Languages is Hard. CIAA (2023)
Markus Holzer, Christian Rauch
Computational Complexity of Reversible Reaction Systems. RC (2023)
Markus Holzer, Christian Rauch
On the Descriptional Complexity of the Direct Product of Finite Automata. DCFS (2022)
Henning Fernau, Markus Holzer, Petra Wolf
Preface to Klaus-Jörn Lange Festschrift. Acta Informatica 59 (4) (2022)
Simon Beier, Markus Holzer
Nondeterministic right one-way jumping finite automata. Inf. Comput. 284 (2022)
Christian Rauch, Markus Holzer
On the Accepting State Complexity of Operations on Permutation Automata. NCMA (2022)
Hermann Gruber, Markus Holzer, Christian Rauch
On 25 Years of CIAA Through the Lens of Data Science. CIAA (2022)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Markus Holzer, Martin Kutrib, Friedrich Otto
Two-Sided Strictly Locally Testable Languages. Fundam. Informaticae 180 (1-2) (2021)
Markus Holzer, José M. Sempere
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019). RAIRO Theor. Informatics Appl. 55 (2021)
Markus Holzer, Christian Rauch
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract). CIAA (2021)
Markus Holzer, Christian Rauch
On the Computational Complexity of Reaction Systems, Revisited. CSR (2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS (2021)
Hermann Gruber, Markus Holzer
Optimal Regular Expressions for Palindromes of Given Length. MFCS (2021)
Hermann Gruber, Markus Holzer, Simon Wolfsteiner
On Minimizing Regular Expressions Without Kleene Star. FCT (2021)
Henning Bordihn, Markus Holzer
On the number of active states in finite automata. Acta Informatica 58 (4) (2021)
Markus Holzer, Christian Rauch
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). DLT (2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR (2021)
Markus Holzer, Martin Kutrib
Preface. Int. J. Found. Comput. Sci. 32 (5) (2021)
Markus Holzer, Christian Rauch
More on the Descriptional Complexity of Products of Finite Automata. DCFS (2021)
Markus Holzer, Martin Kutrib
Automata That May Change Their Mind. J. Autom. Lang. Comb. 25 (2-3) (2020)
Simon Beier, Markus Holzer
Decidability of Right One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 31 (6) (2020)
Michal Hospodár, Markus Holzer
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. Int. J. Found. Comput. Sci. 31 (8) (2020)
Hermann Gruber, Markus Holzer, Simon Wolfsteiner
On Minimizing Regular Expressions Without Kleene Star. Electron. Colloquium Comput. Complex. 27 (2020)
Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
A mesh of automata. Inf. Comput. 265 (2019)
Simon Beier, Markus Holzer
Properties of right one-way jumping finite automata. Theor. Comput. Sci. 798 (2019)
Simon Beier, Markus Holzer, Martin Kutrib
Operational State Complexity and Decidability of Jumping Finite Automata. Int. J. Found. Comput. Sci. 30 (1) (2019)
Simon Beier, Markus Holzer
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract). CIAA (2019)
Markus Holzer, Martin Kutrib
Non-Recursive Trade-Offs Are "Almost Everywhere". CiE (2019)
Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf
Computational Complexity of Synchronization under Regular Constraints. MFCS (2019)
Markus Holzer, Sebastian Jakobi
A comment on strong language families and self-verifying complexity classes. NCMA (2019)
Markus Holzer, Martin Kutrib
One-Time Nondeterministic Computations. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Simon Beier, Markus Holzer
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). DCFS (2019)
Markus Holzer, Michal Hospodár
The Range of State Complexities of Languages Resulting from the Cut Operation. LATA (2019)
Markus Holzer, Martin Kutrib
Automata that may change their mind. NCMA (2018)
Markus Holzer, Simon Wolfsteiner
On the Grammatical Complexity of Finite Languages. DCFS (2018)
Markus Holzer, Bianca Truthe, Ahmad Firdaus Yosman
On bonded sequential and parallel insertion systems. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Simon Beier, Markus Holzer
Properties of Right One-Way Jumping Finite Automata. DCFS (2018)
Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.
Computational Complexity of Decision Problems on Self-verifying Finite Automata. DLT (2018)
Michal Hospodár, Markus Holzer
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. CIAA (2018)
Markus Holzer, Jan-Tobias Maurer
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms. FUN (2018)
Simon Beier, Markus Holzer
Decidability of Right One-Way Jumping Finite Automata. DLT (2018)
Markus Holzer, Sebastian Jakobi
On the computational complexity of problems related to distinguishability sets. Inf. Comput. 259 (2) (2018)
Markus Holzer, Sebastian Jakobi, Martin Kutrib
Minimal Reversible Deterministic Finite Automata. Int. J. Found. Comput. Sci. 29 (2) (2018)
Hermann Gruber, Markus Holzer, Simon Wolfsteiner
On Minimal Grammar Problems for Finite Languages. DLT (2018)
Simon Beier, Markus Holzer, Martin Kutrib
On the Descriptional Complexity of Operations on Semilinear Sets. AFL (2017)
Markus Holzer, Martin Kutrib, Friedrich Otto
Two-sided strictly locally testable languages. NCMA (2017)
Hermann Gruber, Markus Holzer, Sebastian Jakobi
More on deterministic and nondeterministic finite cover automata. Theor. Comput. Sci. 679 (2017)
Markus Holzer, Martin Kutrib
One-Time Nondeterministic Computations. DCFS (2017)
Simon Beier, Markus Holzer
On Regular Expression Proof Complexity. DLT (2017)
Markus Holzer, Sebastian Jakobi, Martin Kutrib
The chop of languages. Theor. Comput. Sci. 682 (2017)
Henning Bordihn, Markus Holzer
On the Number of Active States in Deterministic and Nondeterministic Finite Automata. CIAA (2017)
Markus Holzer, Sebastian Jakobi
More on Minimizing Finite Automata with Errors - Nondeterministic Machines. Int. J. Found. Comput. Sci. 28 (3) (2017)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. AFL (2017)
Markus Holzer, Martin Kutrib
Reversible Nondeterministic Finite Automata. RC (2017)
Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
Tight Bounds for Cut-Operations on Deterministic Finite Automata. Fundam. Informaticae 155 (1-2) (2017)
Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
On the Mother of All Automata: The Position Automaton. DLT (2017)
Simon Beier, Markus Holzer, Martin Kutrib
Operational State Complexity and Decidability of Jumping Finite Automata. DLT (2017)
Holger Bock Axelsen, Markus Holzer, Martin Kutrib
The Degree of Irreversibility in Deterministic Finite Automata. Int. J. Found. Comput. Sci. 28 (5) (2017)
Markus Holzer, Martin Kutrib
Structure and Complexity of Some Subregular Language Families. The Role of Theory in Computer Science (2017)
Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher
Reversible Shrinking Two-Pushdown Automata. LATA (2016)
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
On the Computational Complexity of Partial Word Automata Problems. Fundam. Informaticae 148 (3-4) (2016)
Markus Holzer, Sebastian Jakobi
Minimal and Hyper-Minimal Biautomata. Int. J. Found. Comput. Sci. 27 (2) (2016)
Holger Bock Axelsen, Markus Holzer, Martin Kutrib
The Degree of Irreversibility in Deterministic Finite Automata. CIAA (2016)
Wan Heng Fong, Markus Holzer, Bianca Truthe, Sherzod Turaev, Ahmad Firdaus Yosman
On bonded sequential and parallel insertion systems. NCMA (2016)
Markus Holzer, Martin Kutrib, Bianca Truthe
Preface. J. Autom. Lang. Comb. 21 (1-2) (2016)
Markus Holzer, Sebastian Jakobi
Boundary sets of regular and context-free languages. Theor. Comput. Sci. 610 (2016)
Markus Holzer, Martin Kutrib, Bianca Truthe
Editorial. J. Autom. Lang. Comb. 21 (1-2) (2016)
Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU (2015)
Markus Holzer, Bianca Truthe
On relations between some subregular language families. NCMA (2015)
Hermann Gruber, Markus Holzer
From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. Int. J. Found. Comput. Sci. 26 (8) (2015)
Markus Holzer, Sebastian Jakobi
Minimization and Characterizations for Biautomata. Fundam. Informaticae 136 (1-2) (2015)
Hermann Gruber, Markus Holzer, Sebastian Jakobi
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. CIAA (2015)
Markus Holzer, Sebastian Jakobi
On the Computational Complexity of Problems Related to Distinguishability Sets. DCFS (2015)
Markus Holzer, Sebastian Jakobi, Martin Kutrib
Minimal Reversible Deterministic Finite Automata. DLT (2015)
Markus Holzer, Martin Kutrib
Preface. Int. J. Found. Comput. Sci. 26 (7) (2015)
Henning Fernau, Rudolf Freund, Markus Holzer
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. Int. J. Found. Comput. Sci. 26 (8) (2015)
Markus Holzer, Sebastian Jakobi
More Structural Characterizations of Some Subregular Language Families by Biautomata. AFL (2014)
Markus Holzer, Bianca Truthe
Preface. RAIRO Theor. Informatics Appl. 48 (1) (2014)
Henning Fernau, Rudolf Freund, Markus Holzer
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. AFL (2014)
Markus Holzer, Sebastian Jakobi
Boundary Sets of Regular and Context-Free Languages. DCFS (2014)
Markus Holzer, Sebastian Jakobi
Minimal and Hyper-Minimal Biautomata - (Extended Abstract). Developments in Language Theory (2014)
Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. LATA (2014)
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
On the computational complexity of partial word automata problems. NCMA (2014)
Hermann Gruber, Markus Holzer
From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity. AFL (2014)
Markus Holzer, Martin Kutrib
Self-Assembling Pushdown Automata. J. Autom. Lang. Comb. 19 (1-4) (2014)
Markus Holzer, Sebastian Jakobi
Nondeterministic Biautomata and their Descriptional Complexity. Int. J. Found. Comput. Sci. 25 (7) (2014)
Markus Holzer, Sebastian Jakobi
Nondeterministic Biautomata and Their Descriptional Complexity. DCFS (2013)
Hermann Gruber, Markus Holzer
Provably Shorter Regular Expressions from Finite Automata. Int. J. Found. Comput. Sci. 24 (8) (2013)
Markus Holzer, Sebastian Jakobi
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). CIAA (2013)
Markus Holzer, Sebastian Jakobi
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors. Int. J. Found. Comput. Sci. 24 (7) (2013)
Markus Holzer, Sebastian Jakobi
Minimization and characterizations for biautomata. NCMA (2013)
Markus Holzer, Sebastian Jakobi, Ian McQuillan
Generalized Derivations with Synchronized Context-Free Grammars. Developments in Language Theory (2012)
Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher
Input-Driven Stack Automata. IFIP TCS (2012)
Markus Holzer, Martin Kutrib, Giovanni Pighizzini
Preface. Theor. Comput. Sci. 449 (2012)
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
On Inverse Operations and Their Descriptional Complexity. J. Autom. Lang. Comb. 17 (2-4) (2012)
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini
On Inverse Operations and Their Descriptional Complexity. DCFS (2012)

Markus Holzer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Markus Holzer