Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDMarkus Holzer 0001
Person information
- affiliation: University of Giessen, Germany
- affiliation: University of Tübingen, Germany
- not to be confused with: Markus Holzer 0004
Other persons with the same name
- Markus Holzer 0002 — Pforzheim University of Applied Sciences, Germany
- Markus Holzer 0003 — Medical University of Vienna, Vienna, Austria
- Markus Holzer 0004 — University of Tübingen, Germany
- Markus Holzer 0005
![[0000-0001-5499-5857]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5499-5857")
— University of Erlangen-Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j100]Simon Beier, Markus Holzer:
Nondeterministic right one-way jumping finite automata. Inf. Comput. 284: 104687 (2022)- 2021
- [j99]Henning Bordihn, Markus Holzer:
On the number of active states in finite automata. Acta Informatica 58(4): 301-318 (2021) - [j98]Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-Sided Strictly Locally Testable Languages. Fundam. Informaticae 180(1-2): 29-51 (2021) - [j97]Markus Holzer, Martin Kutrib:
Preface. Int. J. Found. Comput. Sci. 32(5): 417-418 (2021) - [j96]Markus Holzer, José M. Sempere:
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019). RAIRO Theor. Informatics Appl. 55: 1 (2021) - [c141]Markus Holzer, Christian Rauch:
On the Computational Complexity of Reaction Systems, Revisited. CSR 2021: 170-185 - [c140]Markus Holzer, Christian Rauch:
More on the Descriptional Complexity of Products of Finite Automata. DCFS 2021: 76-87 - [c139]Markus Holzer, Christian Rauch:
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). DLT 2021: 229-241 - [c138]Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimizing Regular Expressions Without Kleene Star. FCT 2021: 245-258 - [c137]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: 34:1-34:15 - [c136]Hermann Gruber, Markus Holzer:
Optimal Regular Expressions for Palindromes of Given Length. MFCS 2021: 52:1-52:15 - [c135]Markus Holzer, Christian Rauch:
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract). CIAA 2021: 90-101 - [p2]Hermann Gruber, Markus Holzer, Martin Kutrib:
Descriptional complexity of regular languages. Handbook of Automata Theory (I.) 2021: 411-457 - [i10]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 abs/2110.01279 (2021) - 2020
- [j95]Simon Beier, Markus Holzer:
Decidability of Right One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 31(6): 805-825 (2020) - [j94]Michal Hospodár, Markus Holzer:
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. Int. J. Found. Comput. Sci. 31(8): 1159-1177 (2020) - [j93]Markus Holzer, Martin Kutrib:
Automata That May Change Their Mind. J. Autom. Lang. Comb. 25(2-3): 115-140 (2020) - [i9]Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimizing Regular Expressions Without Kleene Star. Electron. Colloquium Comput. Complex. 27: 79 (2020)
2010 – 2019
- 2019
- [j92]Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis:
A mesh of automata. Inf. Comput. 265: 94-111 (2019) - [j91]Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. Int. J. Found. Comput. Sci. 30(1): 5-27 (2019) - [j90]Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. Int. J. Found. Comput. Sci. 30(6-7): 1069-1089 (2019) - [j89]Simon Beier, Markus Holzer:
Properties of right one-way jumping finite automata. Theor. Comput. Sci. 798: 78-94 (2019) - [c134]Markus Holzer, Martin Kutrib:
Non-Recursive Trade-Offs Are "Almost Everywhere". CiE 2019: 25-36 - [c133]Simon Beier, Markus Holzer:
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). DCFS 2019: 74-85 - [c132]Markus Holzer, Michal Hospodár:
The Range of State Complexities of Languages Resulting from the Cut Operation. LATA 2019: 190-202 - [c131]Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf:
Computational Complexity of Synchronization under Regular Constraints. MFCS 2019: 63:1-63:14 - [c130]Markus Holzer, Sebastian Jakobi:
A comment on strong language families and self-verifying complexity classes. NCMA 2019: 93-108 - [c129]Simon Beier, Markus Holzer:
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract). CIAA 2019: 70-82 - [e8]Rudolf Freund, Markus Holzer, José M. Sempere:
Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019. Österreichische Computer Gesellschaft 2019, ISBN 978-3-903035-25-6 [contents] - 2018
- [j88]Markus Holzer, Sebastian Jakobi:
On the computational complexity of problems related to distinguishability sets. Inf. Comput. 259(2): 225-236 (2018) - [j87]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. Int. J. Found. Comput. Sci. 29(2): 251-270 (2018) - [j86]Markus Holzer, Bianca Truthe, Ahmad Firdaus Yosman:
On bonded sequential and parallel insertion systems. RAIRO Theor. Informatics Appl. 52(2-3-4): 127-151 (2018) - [c128]Simon Beier, Markus Holzer:
Properties of Right One-Way Jumping Finite Automata. DCFS 2018: 11-23 - [c127]Markus Holzer, Simon Wolfsteiner:
On the Grammatical Complexity of Finite Languages. DCFS 2018: 151-162 - [c126]Simon Beier, Markus Holzer:
Decidability of Right One-Way Jumping Finite Automata. DLT 2018: 109-120 - [c125]Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimal Grammar Problems for Finite Languages. DLT 2018: 342-353 - [c124]Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.:
Computational Complexity of Decision Problems on Self-verifying Finite Automata. DLT 2018: 404-415 - [c123]Markus Holzer, Jan-Tobias Maurer:
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms. FUN 2018: 23:1-23:21 - [c122]Markus Holzer, Martin Kutrib:
Automata that may change their mind. NCMA 2018: 83-98 - [c121]Michal Hospodár, Markus Holzer:
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. CIAA 2018: 198-210 - 2017
- [j85]Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. Fundam. Informaticae 155(1-2): 89-110 (2017) - [j84]Markus Holzer, Sebastian Jakobi:
More on Minimizing Finite Automata with Errors - Nondeterministic Machines. Int. J. Found. Comput. Sci. 28(3): 229-246 (2017) - [j83]Holger Bock Axelsen, Markus Holzer, Martin Kutrib:
The Degree of Irreversibility in Deterministic Finite Automata. Int. J. Found. Comput. Sci. 28(5): 503-522 (2017) - [j82]Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on deterministic and nondeterministic finite cover automata. Theor. Comput. Sci. 679: 18-30 (2017) - [j81]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The chop of languages. Theor. Comput. Sci. 682: 122-137 (2017) - [c120]Markus Holzer, Martin Kutrib:
Structure and Complexity of Some Subregular Language Families. The Role of Theory in Computer Science 2017: 59-82 - [c119]Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. DCFS 2017: 177-188 - [c118]Simon Beier, Markus Holzer:
On Regular Expression Proof Complexity. DLT 2017: 83-95 - [c117]Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. DLT 2017: 96-108 - [c116]Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis:
On the Mother of All Automata: The Position Automaton. DLT 2017: 134-146 - [c115]Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-sided strictly locally testable languages. NCMA 2017: 135-150 - [c114]Markus Holzer, Martin Kutrib:
Reversible Nondeterministic Finite Automata. RC 2017: 35-51 - [c113]Henning Bordihn, Markus Holzer:
On the Number of Active States in Deterministic and Nondeterministic Finite Automata. CIAA 2017: 40-51 - [c112]Simon Beier, Markus Holzer, Martin Kutrib:
On the Descriptional Complexity of Operations on Semilinear Sets. AFL 2017: 41-55 - [c111]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. AFL 2017: 128-142 - 2016
- [j80]Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the Computational Complexity of Partial Word Automata Problems. Fundam. Informaticae 148(3-4): 267-289 (2016) - [j79]Markus Holzer, Sebastian Jakobi:
Minimal and Hyper-Minimal Biautomata. Int. J. Found. Comput. Sci. 27(2): 161-186 (2016) - [j78]Markus Holzer, Martin Kutrib, Bianca Truthe:
Editorial. J. Autom. Lang. Comb. 21(1-2): 3-4 (2016) - [j77]Markus Holzer, Martin Kutrib, Bianca Truthe:
Preface. J. Autom. Lang. Comb. 21(1-2): 5-6 (2016) - [j76]Markus Holzer, Sebastian Jakobi:
Boundary sets of regular and context-free languages. Theor. Comput. Sci. 610: 59-77 (2016) - [c110]Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. LATA 2016: 579-591 - [c109]Wan Heng Fong, Markus Holzer, Bianca Truthe, Sherzod Turaev, Ahmad Firdaus Yosman:
On bonded sequential and parallel insertion systems. NCMA 2016: 163-178 - [c108]Holger Bock Axelsen, Markus Holzer, Martin Kutrib:
The Degree of Irreversibility in Deterministic Finite Automata. CIAA 2016: 15-26 - 2015
- [j75]Markus Holzer, Sebastian Jakobi:
Minimization and Characterizations for Biautomata. Fundam. Informaticae 136(1-2): 113-137 (2015) - [j74]Markus Holzer, Martin Kutrib:
Preface. Int. J. Found. Comput. Sci. 26(7): 803-804 (2015) - [j73]Hermann Gruber, Markus Holzer:
From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. Int. J. Found. Comput. Sci. 26(8): 1009-1040 (2015) - [j72]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): 1167-1188 (2015) - [c107]Markus Holzer, Sebastian Jakobi:
On the Computational Complexity of Problems Related to Distinguishability Sets. DCFS 2015: 117-128 - [c106]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. DLT 2015: 276-287 - [c105]Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU 2015: 45-60 - [c104]Markus Holzer, Bianca Truthe:
On relations between some subregular language families. NCMA 2015: 109-124 - [c103]Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. CIAA 2015: 114-126 - [e7]Rudolf Freund, Markus Holzer, Nelma Moreira, Rogério Reis:
Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings. books@ocg.at 318, Österreichische Computer Gesellschaft 2015, ISBN 978-3-903035-07-2 [contents] - 2014
- [j71]Markus Holzer, Sebastian Jakobi:
Nondeterministic Biautomata and their Descriptional Complexity. Int. J. Found. Comput. Sci. 25(7): 837-856 (2014) - [j70]Markus Holzer, Bianca Truthe:
Preface. RAIRO Theor. Informatics Appl. 48(1): 1-2 (2014) - [j69]Markus Holzer, Martin Kutrib:
Self-Assembling Pushdown Automata. J. Autom. Lang. Comb. 19(1-4): 107-118 (2014) - [c102]Markus Holzer, Sebastian Jakobi:
Boundary Sets of Regular and Context-Free Languages. DCFS 2014: 162-173 - [c101]Markus Holzer, Sebastian Jakobi:
Minimal and Hyper-Minimal Biautomata - (Extended Abstract). Developments in Language Theory 2014: 291-302 - [c100]Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard:
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. LATA 2014: 372-383 - [c99]Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the computational complexity of partial word automata problems. NCMA 2014: 131-146 - [c98]Hermann Gruber, Markus Holzer:
From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity. AFL 2014: 25-48 - [c97]Henning Fernau, Rudolf Freund, Markus Holzer:
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. AFL 2014: 246-260 - [c96]Markus Holzer, Sebastian Jakobi:
More Structural Characterizations of Some Subregular Language Families by Biautomata. AFL 2014: 271-285 - [e6]Markus Holzer, Martin Kutrib:
Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings. Lecture Notes in Computer Science 8587, Springer 2014, ISBN 978-3-319-08845-7 [contents] - 2013
- [j68]Markus Holzer, Sebastian Jakobi:
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors. Int. J. Found. Comput. Sci. 24(7): 1083-1098 (2013) - [j67]Hermann Gruber, Markus Holzer:
Provably Shorter Regular Expressions from Finite Automata. Int. J. Found. Comput. Sci. 24(8): 1255-1280 (2013) - [c95]Markus Holzer, Sebastian Jakobi:
Nondeterministic Biautomata and Their Descriptional Complexity. DCFS 2013: 112-123 - [c94]Markus Holzer, Sebastian Jakobi:
Minimization and characterizations for biautomata. NCMA 2013: 179-193 - [c93]Markus Holzer, Sebastian Jakobi:
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). CIAA 2013: 181-192 - 2012
- [j66]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. 23(1): 115-131 (2012) - [j65]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO Theor. Informatics Appl. 46(4): 459-460 (2012) - [j64]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): 61-81 (2012) - [j63]Markus Holzer, Sebastian Jakobi:
Descriptional Complexity of Chop Operations on Unary and Finite Languages. J. Autom. Lang. Comb. 17(2-4): 165-183 (2012) - [j62]Markus Holzer, Martin Kutrib, Giovanni Pighizzini:
Preface. Theor. Comput. Sci. 449: 1 (2012) - [j61]Markus Holzer, Martin Kutrib, Katja Meckel:
Nondeterministic state complexity of star-free languages. Theor. Comput. Sci. 450: 68-80 (2012) - [c92]Markus Holzer:
A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems. Languages Alive 2012: 86-98 - [c91]Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini:
On Inverse Operations and Their Descriptional Complexity. DCFS 2012: 89-102 - [c90]Markus Holzer, Sebastian Jakobi:
State Complexity of Chop Operations on Unary and Finite Languages. DCFS 2012: 169-182 - [c89]Markus Holzer, Sebastian Jakobi, Ian McQuillan:
Generalized Derivations with Synchronized Context-Free Grammars. Developments in Language Theory 2012: 109-120 - [c88]Markus Holzer, Sebastian Jakobi:
From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract). Developments in Language Theory 2012: 190-201 - [c87]Jakob Engel, Markus Holzer, Oliver Ruepp, Frank Sehnke:
On Computer Integrated Rationalized Crossword Puzzle Manufacturing. FUN 2012: 131-141 - [c86]Markus Holzer, Sebastian Jakobi:
On the Complexity of Rolling Block and Alice Mazes. FUN 2012: 210-222 - [c85]Markus Holzer, Sebastian Jakobi:
Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes. FUN 2012: 223-234 - [c84]Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher:
Input-Driven Stack Automata. IFIP TCS 2012: 28-42 - [e5]Rudolf Freund, Markus Holzer, Bianca Truthe, Ulrich Ultes-Nitsche:
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 [contents] - 2011
- [j60]Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp:
Computational Complexity of NURIKABE. Fundam. Informaticae 110(1-4): 159-174 (2011) - [j59]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto:
Preface. Fundam. Informaticae 112(2-3) (2011) - [j58]Henning Bordihn, Markus Holzer, Martin Kutrib:
Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011) - [j57]Markus Holzer, Martin Kutrib:
Descriptional and computational complexity of finite automata - A survey. Inf. Comput. 209(3): 456-470 (2011) - [j56]Markus Holzer, Martin Kutrib:
The Complexity of Regular(-like) Expressions. Int. J. Found. Comput. Sci. 22(7): 1533-1548 (2011) - [j55]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hairpin Finite Automata. J. Autom. Lang. Comb. 16(2-4): 91-107 (2011) - [j54]Markus Holzer, Martin Kutrib, Andreas Malcher:
Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011) - [j53]Felix Brandt, Felix A. Fischer, Markus Holzer:
Equilibria of graphical games with symmetries. Theor. Comput. Sci. 412(8-10): 675-685 (2011) - [j52]Martin Beaudry, Markus Holzer:
On the size of inverse semigroups given by generators. Theor. Comput. Sci. 412(8-10): 765-772 (2011) - [c83]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Chop of Languages. AFL 2011: 197-210 - [c82]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 - [c81]Markus Holzer, Sebastian Jakobi:
Chop Operations and Expressions: Descriptional Complexity Considerations. Developments in Language Theory 2011: 264-275 - [c80]Markus Holzer, Martin Kutrib, Ursula Leiter:
Nodes Connected by Path Languages. Developments in Language Theory 2011: 276-287 - [c79]Markus Holzer, Martin Kutrib:
Gaining Power by Input Operations: Finite Automata and Beyond. CIAA 2011: 16-29 - [c78]Markus Holzer, Martin Kutrib, Katja Meckel:
Nondeterministic State Complexity of Star-Free Languages. CIAA 2011: 178-189 - [e4]Markus Holzer, Martin Kutrib, Giovanni Pighizzini:
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 [contents] - [e3]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
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 [contents] - 2010
- [j51]Henning Bordihn, Jürgen Dassow, Markus Holzer:
Extending regular expressions with homomorphic replacement. RAIRO Theor. Informatics Appl. 44(2): 229-255 (2010) - [j50]