default search action
Google
Google Scholar
Semantic Scholar
Internet Archive 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
- 2024
[c151]Simon Beier, Markus Holzer:
On Regular Expression Proof Complexity of Salomaa's Axiom System F1. Taming the Infinities of Concurrency 2024: 72-100- [c150]Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Context-Free Languages is Undecidable. DLT 2024: 141-155 - [c149]Hermann Gruber, Markus Holzer, Christian Rauch:
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). CIAA 2024: 153-165 - 2023
- [j104]Markus Holzer, Christian Rauch:
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case. Int. J. Found. Comput. Sci. 34(8): 987-1022 (2023) - [j103]Christian Rauch, Markus Holzer:
On the accepting state complexity of operations on permutation automata. RAIRO Theor. Informatics Appl. 57: 9 (2023) - [c148]Markus Holzer, Christian Rauch:
On Jaffe's Pumping Lemma, Revisited. DCFS 2023: 65-78 - [c147]Markus Holzer, Christian Rauch:
Computational Complexity of Reversible Reaction Systems. RC 2023: 40-54 - [c146]Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Regular Languages is Hard. CIAA 2023: 128-140 - [c145]Markus Holzer, Christian Rauch:
On Minimal Pumping Constants for Regular Languages. AFL 2023: 127-141 - 2022
- [j102]Henning Fernau, Markus Holzer, Petra Wolf:
Preface to Klaus-Jörn Lange Festschrift. Acta Informatica 59(4): 285-287 (2022) - [j101]Simon Beier, Markus Holzer:
Nondeterministic right one-way jumping finite automata. Inf. Comput. 284: 104687 (2022) - [j100]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33(3&4): 285-311 (2022) - [c144]Markus Holzer, Christian Rauch:
On the Descriptional Complexity of the Direct Product of Finite Automata. DCFS 2022: 100-111 - [c143]Hermann Gruber, Markus Holzer, Christian Rauch:
On 25 Years of CIAA Through the Lens of Data Science. CIAA 2022: 3-18 - [c142]Christian Rauch, Markus Holzer:
On the Accepting State Complexity of Operations on Permutation Automata. NCMA 2022: 177-189 - 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-2 (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. TR20 (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]Hermann Gruber, Markus Holzer, Martin Kutrib:
On Measuring Non-recursive Trade-Offs. J. Autom. Lang. Comb. 15(1/2): 107-120 (2010) - [j49]Markus Holzer, Andreas Maletti:
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411(38-39): 3404-3413 (2010) - [c77]Markus Holzer, Martin Kutrib:
The Complexity of Regular(-Like) Expressions. Developments in Language Theory 2010: 16-30 - [c76]Markus Holzer, Pierre McKenzie:
The Computational Complexity of RaceTrack. FUN 2010: 260-271 - [c75]Oliver Ruepp, Markus Holzer:
The Computational Complexity of the Kakuro Puzzle, Revisited. FUN 2010: 319-330 - [c74]Markus Holzer, Martin Kutrib:
Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Int. Conf. on Membrane Computing 2010: 19-36 - [c73]Markus Holzer, Martin Kutrib:
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP 2010: 1-23 - [c72]Felix Brandt, Felix A. Fischer, Markus Holzer:
On Iterated Dominance, Matrix Elimination, and Matched Paths. STACS 2010: 107-118 - [c71]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. DCFS 2010: 110-119 - [p1]Markus Holzer, Martin Kutrib:
Descriptional Complexity - An Introductory Survey. Scientific Applications of Language Methods 2010: 1-58 - [e2]Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto:
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 [contents] - [i8]Felix Brandt, Felix A. Fischer, Markus Holzer:
On Iterated Dominance, Matrix Elimination, and Matched Paths. CoRR abs/1001.0529 (2010)
2000 – 2009
- 2009
- [j48]Hermann Gruber, Markus Holzer, Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Informaticae 91(1): 105-121 (2009) - [j47]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009) - [j46]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) - [j45]Felix Brandt, Felix A. Fischer, Markus Holzer:
Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci. 75(3): 163-177 (2009) - [j44]Henning Bordihn, Markus Holzer, Martin Kutrib:
Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009) - [j43]Hermann Gruber, Markus Holzer:
Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410(35): 3281-3289 (2009) - [j42]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) - [c70]Hermann Gruber, Markus Holzer:
Tight Bounds on the Descriptional Complexity of Regular Expressions. Developments in Language Theory 2009: 276-287 - [c69]Markus Holzer, Martin Kutrib:
Descriptional and Computational Complexity of Finite Automata. LATA 2009: 23-42 - [c68]Henning Bordihn, Markus Holzer, Martin Kutrib:
Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246 - [c67]Markus Holzer, Andreas Maletti:
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. CIAA 2009: 4-13 - [c66]Hermann Gruber, Markus Holzer, Michael Tautschnig:
Short Regular Expressions from Finite Automata: Empirical Results. CIAA 2009: 188-197 - [c65]Hermann Gruber, Markus Holzer, Martin Kutrib:
On Measuring Non-Recursive Trade-Offs. DCFS 2009: 141-150 - [e1]Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto:
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 [contents] - 2008
- [j41]Henning Bordihn, Markus Holzer:
A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008) - [c64]Henning Bordihn, Markus Holzer, Martin Kutrib:
State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96 - [c63]Hermann Gruber, Markus Holzer:
Language Operations with Regular Expressions of Polynomial Size. DCFS 2008: 182-193 - [c62]Hermann Gruber, Markus Holzer:
Provably Shorter Regular Expressions from Deterministic Finite Automata. Developments in Language Theory 2008: 383-395 - [c61]Hermann Gruber, Markus Holzer:
Finite Automata, Digraph Connectivity, and Regular Expression Size. ICALP (2) 2008: 39-50 - [c60]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124 - [c59]Henning Bordihn, Markus Holzer:
Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. LATA 2008: 125-136 - [c58]Markus Holzer, Martin Kutrib:
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA 2008: 1-16 - [c57]Felix Brandt, Felix A. Fischer, Markus Holzer:
Equilibria of Graphical Games with Symmetries. WINE 2008: 198-209 - [c56]Markus Holzer, Martin Kutrib, Andreas Malcher:
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. CSP 2008: 93-107 - [i7]Felix Brandt, Felix A. Fischer, Markus Holzer:
On Iterated Dominance, Matrix Elimination, and Matched Paths. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j40]Martin Beaudry, Markus Holzer:
The Complexity of Tensor Circuit Evaluation. Comput. Complex. 16(1): 60-111 (2007) - [j39]Henning Bordihn, Markus Holzer:
Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Fundam. Informaticae 76(3): 255-270 (2007) - [j38]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007) - [j37]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) - [j36]Markus Holzer, Martin Kutrib, Jens Reimann:
Non-Recursive Trade-Offs for Deterministic Restarting Automata. J. Autom. Lang. Comb. 12(1-2): 195-213 (2007) - [j35]Hermann Gruber, Markus Holzer:
On the average state and transition complexity of finite languages. Theor. Comput. Sci. 387(2): 155-166 (2007) - [j34]Hermann Gruber, Markus Holzer, Martin Kutrib:
The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007) - [c55]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hairpin Finite Automata. Developments in Language Theory 2007: 108-119 - [c54]Hermann Gruber, Markus Holzer:
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Developments in Language Theory 2007: 205-216 - [c53]Hermann Gruber, Markus Holzer, Oliver Ruepp:
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. FUN 2007: 183-197 - [c52]Markus Holzer, Oliver Ruepp:
The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. FUN 2007: 198-212 - [c51]Hermann Gruber, Markus Holzer:
Computational Complexity of NFA Minimization for Finite and Unary Languages. LATA 2007: 261-272 - [c50]Hermann Gruber, Markus Holzer, Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204 - [c49]Felix Brandt, Felix A. Fischer, Markus Holzer:
Symmetries and the Complexity of Pure Nash Equilibrium. STACS 2007: 212-223 - [i6]Felix Brandt, Felix A. Fischer, Markus Holzer:
Equilibria of Graphical Games with Symmetries. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j33]Henning Bordihn, Markus Holzer:
Programmed grammars and their relation to the LBA problem. Acta Informatica 43(4): 223-242 (2006) - [j32]Markus Holzer, Martin Kutrib:
Variable Complexity of Simple Programs. Fundam. Informaticae 74(4): 511-528 (2006) - [j31]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) - [j30]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) - [j29]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) - [c48]Markus Holzer, Martin Kutrib:
The Size of Higman-Haines Sets. DCFS 2006: 177-187 - [c47]Hermann Gruber, Markus Holzer:
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS 2006: 267-275 - [c46]Hermann Gruber, Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Developments in Language Theory 2006: 363-374 - [c45]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. CIAA 2006: 34-45 - [i5]Felix Brandt, Felix A. Fischer, Markus Holzer:
Symmetries and the Complexity of Pure Nash Equilibrium. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Hermann Gruber, Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity is Hard. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j28]Henning Fernau, Rudolf Freund, Markus Holzer:
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Informaticae 64(1-4): 159-170 (2005) - [j27]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) - [j26]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) - [j25]Markus Holzer, Martin Kutrib:
On the descriptional complexity of finite automata with modified acceptance conditions. Theor. Comput. Sci. 330(2): 267-285 (2005) - [j24]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) - [c44]Markus Holzer, Martin Kutrib, Jens Reimann:
Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169 - [c43]Henning Bordihn, Markus Holzer, Martin Kutrib:
Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179 - [c42]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 - [c41]Markus Holzer, Friedrich Otto:
Shrinking Multi-pushdown Automata. FCT 2005: 305-316 - 2004
- [j23]Markus Holzer, Waltraud Holzer:
TantrixTM rotation puzzles are intractable. Discret. Appl. Math. 144(3): 345-358 (2004) - [j22]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). Bull. EATCS 83: 139-155 (2004) - [j21]Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Description for Basic Constructions on Rational Transductions. J. Autom. Lang. Comb. 9(2/3): 175-188 (2004) - [j20]Markus Holzer, Stefan Schwoon:
Assembling molecules in ATOMIX is hard. Theor. Comput. Sci. 313(3): 447-462 (2004) - [j19]Markus Holzer, Barbara König:
On deterministic finite automata and syntactic monoid size. Theor. Comput. Sci. 327(3): 319-347 (2004) - [c40]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 - [c39]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 - [c38]Markus Holzer, Martin Kutrib:
Register Complexity of LOOP-, WHILE-, and GOTO-Programs. MCU 2004: 233-244 - [c37]Martin Beaudry, José M. Fernandez, Markus Holzer:
A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). MFCS 2004: 851-862 - [c36]Markus Holzer, Stefan Katzenbeisser, Christian Schallhart:
Towards Formal Semantics for ODRL. ODRL Workshop 2004: 137-148 - [c35]Henning Bordihn, Markus Holzer, Martin Kutrib:
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79 - 2003
- [j18]Markus Holzer, Martin Kutrib:
Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. 14(6): 1087-1102 (2003) - [j17]Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
McNaughton families of languages. Theor. Comput. Sci. 290(3): 1581-1628 (2003) - [j16]Markus Holzer, Pierre McKenzie:
Alternating and empty alternating auxiliary stack automata. Theor. Comput. Sci. 299(1-3): 307-326 (2003) - [j15]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. 299(1-3): 633-662 (2003) - [c34]Henning Bordihn, Henning Fernau, Markus Holzer:
On Iterated Sequential Transducers. Grammars and Automata for String Processing 2003: 121-130 - [c33]Markus Holzer:
On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions. DCFS 2003: 26-41 - [c32]Markus Holzer, Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size, Continued. Developments in Language Theory 2003: 349-360 - [c31]Markus Holzer, Martin Kutrib:
Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory 2003: 361-372 - [c30]Markus Holzer, Martin Kutrib:
Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. ICALP 2003: 490-501 - 2002
- [j14]Carsten Damm, Markus Holzer, Pierre McKenzie:
The complexity of tensor calculus. Comput. Complex. 11(1-2): 54-89 (2002) - [j13]Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. J. Autom. Lang. Comb. 7(4): 487-503 (2002) - [j12]Henning Bordihn, Markus Holzer:
On the Computational Complexity of Synchronized Context-Free Languages. J. Univers. Comput. Sci. 8(2): 119-140 (2002) - [j11]Markus Holzer:
Multi-head finite automata: data-independent versus data-dependent computations. Theor. Comput. Sci. 286(1): 97-116 (2002) - [c29]Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69 - [c28]Markus Holzer, Martin Kutrib:
Unary Language Operations and Their Nondeterministic State Complexity. Developments in Language Theory 2002: 162-172 - [c27]Markus Holzer, Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size. Developments in Language Theory 2002: 258-269 - [c26]Markus Holzer, Martin Kutrib:
State Complexity of Basic Operations on Nondeterministic Finite Automata. CIAA 2002: 148-157 - 2001
- [j10]Henning Bordihn, Markus Holzer:
On the Number of Active Symbols in L and CD Grammar Systems. J. Autom. Lang. Comb. 6(4): 411-426 (2001) - [j9]Markus Holzer, Kai Salomaa, Sheng Yu:
On the State Complexity of k-Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 6(4): 453-466 (2001) - [j8]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) - [c25]Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. DCFS 2001: 79-90 - [c24]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 - [c23]Martin Beaudry, Markus Holzer:
The Complexity of Tensor Circuit Evaluation. MFCS 2001: 173-185 - [c22]Markus Holzer, Martin Kutrib:
Improving Raster Image Run-Length Encoding Using Data Order. CIAA 2001: 161-176 - 2000
- [j7]Henning Bordihn, Markus Holzer:
Grammar Systems with Negated Conditions in their Cooperation Protocols. J. Univers. Comput. Sci. 6(12): 1165-1184 (2000) - [c21]Henning Fernau, Markus Holzer:
External Contextual and Conditional Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 104-120 - [c20]Carsten Damm, Markus Holzer, Pierre McKenzie:
The Complexity of Tensor Calculus. CCC 2000: 70-86 - [c19]Markus Holzer, Pierre McKenzie:
Alternating and Empty Alternating Auxiliary Stack Automata. MFCS 2000: 415-425 - [i3]Carsten Damm, Markus Holzer, Pierre McKenzie:
The Complexity of Tensor Calculus. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j6]Henning Bordihn, Henning Fernau, Markus Holzer:
On Accepting Pure Lindenmayer Systems. Fundam. Informaticae 38(4): 365-375 (1999) - [j5]Henning Bordihn, Markus Holzer:
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. Inf. Process. Lett. 69(2): 59-62 (1999) - [c18]Henning Bordihn, Markus Holzer:
Cooperating distributed grammar systems with non-terminating components. Developments in Language Theory 1999: 305-315 - [c17]Markus Holzer:
On fixed and general membership for external and internal contextual languages. Developments in Language Theory 1999: 351-361 - [c16]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 - [c15]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 - 1998
- [b1]Markus Holzer:
Data-independent versus data-dependent computations on multi-head automata. University of Tübingen, Germany, Bertz 1998, ISBN 978-3-929470-60-4, pp. 1-142 - [c14]Markus Holzer, Muriel Quenzer:
VisA: towards a students' green card to automata theory and formal languages. ACSE 1998: 67-75 - [c13]Markus Holzer, Muriel Quenzer:
VisA: A Tool for Visualizing and Animating Automata and Formal Languages. GD 1998: 450-451 - [c12]Henning Fernau, Rudolf Freund, Markus Holzer:
The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56 - [c11]Henning Fernau, Rudolf Freund, Markus Holzer:
Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291 - 1997
- [j4]Carsten Damm, Markus Holzer, Peter Rossmanith:
Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997) - [c10]Henning Fernau, Markus Holzer:
Conditional Context-Free Languages of Finite Index. New Trends in Formal Languages 1997: 10-26 - [c9]Markus Holzer, Klaus-Jörn Lange:
On the Complexity of Iterated Insertions. New Trends in Formal Languages 1997: 440-453 - [c8]Henning Fernau, Markus Holzer, Rudolf Freund:
Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory 1997: 261-272 - [c7]Markus Holzer:
Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. MFCS 1997: 299-308 - 1996
- [j3]Henning Fernau, Markus Holzer:
Accepting Multi-Agent Systems II. Acta Cybern. 12(4): 361-379 (1996) - [j2]Henning Fernau, Markus Holzer, Henning Bordihn:
Accepting Multi-Agent Systems. Comput. Artif. Intell. 15(2-3): 123-139 (1996) - [j1]Carsten Damm, Markus Holzer:
Inductive Counting for Width-Restricted Branching Programs. Inf. Comput. 130(1): 91-99 (1996) - 1995
- [c6]Markus Holzer:
On Emptiness and Counting for Alternating Finite Automata. Developments in Language Theory 1995: 88-97 - [c5]Carsten Damm, Markus Holzer:
Automata That Take Advice. MFCS 1995: 149-158 - [i2]Carsten Damm, Markus Holzer, Peter Rossmanith:
Expressing Uniformity via Oracles. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-01 (1995) - 1994
- [c4]Carsten Damm, Markus Holzer:
Inductive Counting Below LOGSPACE. MFCS 1994: 276-285 - [i1]Carsten Damm, Markus Holzer:
Inductive Counting below LOGSPACE. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-12 (1994) - 1993
- [c3]Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith:
Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. Developments in Language Theory 1993: 305-313 - [c2]Markus Holzer, Klaus-Jörn Lange:
On the Complexities of Linear LL(1) and LR(1) Grammars. FCT 1993: 299-308 - 1992
- [c1]Carsten Damm, Markus Holzer, Klaus-Jörn Lange:
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS 1992: 227-235
Coauthor Index
[j100] [j98] [j97] [p2] [j93] [j91] [j90] [c134] [j87] [c122] [j83] [j81] [c120] [c119] [c117] [c115] [c114] [c112] [c111] [j78] [j77] [c110] [c108] [j74] [c106] [j69] [c100] [e6] [j66] [j62] [j61] [c84] [j60] [j59] [j58] [j57] [j56] [j55] [j54] [c83] [c80] [c79] [c78] [e4] [j50] [c77] [c74] [c73] [c71] [p1] [e2] [j48] [j47] [j46] [j44] [c69] [c68] [c65] [e1] [c64] [c60] [c58] [c56] [j38] [j36] [j34] [c55] [c50] [j32] [c48] [c45] [j27] [j25] [c44] [c43] [j21] [c39] [c38] [c35] [j18] [c31] [c30] [c29] [c28] [c26] [c22]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
