Markus Holzer
Markus Holzer
Professor für Informatik, Universität Giessen
Verified email at in.tum.de
Title
Cited by
Cited by
Year
Nondeterministic descriptional complexity of regular languages
M Holzer, M Kutrib
International Journal of Foundations of Computer Science 14 (06), 1087-1102, 2003
1362003
Descriptional and computational complexity of finite automata—A survey
M Holzer, M Kutrib
Information and Computation 209 (3), 456-470, 2011
1282011
Finite automata, digraph connectivity, and regular expression size
H Gruber, M Holzer
International Colloquium on Automata, Languages, and Programming, 39-50, 2008
842008
Symmetries and the complexity of pure Nash equilibrium
F Brandt, F Fischer, M Holzer
Journal of computer and system sciences 75 (3), 163-177, 2009
702009
State complexity of basic operations on nondeterministic finite automata
M Holzer, M Kutrib
International Conference on Implementation and Application of Automata, 148-157, 2002
702002
On deterministic finite automata and syntactic monoid size
M Holzer, B König
Theoretical Computer Science 327 (3), 319-347, 2004
672004
Descriptional complexity—an introductory survey
M Holzer, M Kutrib
Scientific Applications of Language Methods, 1-58, 2011
662011
On deterministic finite automata and syntactic monoid size
M Holzer, B König
Theoretical Computer Science 327 (3), 319-347, 2004
592004
On the state complexity of k-entry deterministic finite automata
M Holzer, K Salomaa, S Yu
Journal of Automata, Languages and Combinatorics 6 (4), 453-466, 2001
562001
Finding lower bounds for nondeterministic state complexity is hard
H Gruber, M Holzer
International Conference on Developments in Language Theory, 363-374, 2006
552006
Determination of finite automata accepting subregular languages
H Bordihn, M Holzer, M Kutrib
Theoretical Computer Science 410 (35), 3209-3222, 2009
542009
Complexity of multi-head finite automata: Origins and directions
M Holzer, M Kutrib, A Malcher
Theoretical Computer Science 412 (1-2), 83-96, 2011
522011
Unary language operations and their nondeterministic state complexity
M Holzer, M Kutrib
International Conference on Developments in Language Theory, 162-172, 2002
512002
Inapproximability of nondeterministic state and transition complexity assuming P≠ NP
H Gruber, M Holzer
International Conference on Developments in Language Theory, 205-216, 2007
462007
Nondeterministic finite automata—recent results on the descriptional and computational complexity
M Holzer, M Kutrib
International Journal of Foundations of Computer Science 20 (04), 563-580, 2009
422009
Automata that take advice
C Damm, M Holzer
International Symposium on Mathematical Foundations of Computer Science, 149-158, 1995
391995
Assembling molecules in ATOMIX is hard
M Holzer, S Schwoon
Theoretical computer science 313 (3), 447-462, 2004
372004
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
H Fernau, M Holzer, R Freund
Theoretical Computer Science 259 (1-2), 405-426, 2001
332001
Multi-head finite automata: Characterizations, concepts and open problems
M Holzer, M Kutrib, A Malcher
arXiv preprint arXiv:0906.3051, 2009
322009
Computational Complexity of NFA Minimization for Finite and Unary Languages.
H Gruber, M Holzer
LATA 8, 261-272, 2007
312007
The system can't perform the operation now. Try again later.
Articles 1–20