Follow
Markus Holzer
Markus Holzer
Professor für Informatik, Universität Giessen
Verified email at in.tum.de
Title
Cited by
Cited by
Year
Descriptional and computational complexity of finite automata—A survey
M Holzer, M Kutrib
Information and Computation 209 (3), 456-470, 2011
1492011
Nondeterministic descriptional complexity of regular languages
M Holzer, M Kutrib
International Journal of Foundations of Computer Science 14 (06), 1087-1102, 2003
1482003
Finite automata, digraph connectivity, and regular expression size
H Gruber, M Holzer
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
1002008
State complexity of basic operations on nondeterministic finite automata
M Holzer, M Kutrib
Implementation and Application of Automata: 7th International Conference …, 2003
782003
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
762009
Descriptional complexity—an introductory survey
M Holzer, M Kutrib
Scientific Applications of Language Methods, 1-58, 2011
732011
On deterministic finite automata and syntactic monoid size
M Holzer, B König
Theoretical Computer Science 327 (3), 319-347, 2004
652004
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
622001
Finding lower bounds for nondeterministic state complexity is hard
H Gruber, M Holzer
Developments in language theory 4036, 363-374, 2006
602006
Complexity of multi-head finite automata: Origins and directions
M Holzer, M Kutrib, A Malcher
Theoretical Computer Science 412 (1-2), 83-96, 2011
582011
On deterministic finite automata and syntactic monoid size
M Holzer, B König
Theoretical Computer Science 327 (3), 319-347, 2004
582004
Determination of finite automata accepting subregular languages
H Bordihn, M Holzer, M Kutrib
Theoretical Computer Science 410 (35), 3209-3222, 2009
572009
Unary language operations and their nondeterministic state complexity
M Holzer, M Kutrib
Developments in Language Theory, 162-172, 2002
562002
Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
H Gruber, M Holzer
Developments in Language Theory: 11th International Conference, DLT 2007 …, 2007
552007
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
522009
Automata that take advice
C Damm, M Holzer
Mathematical Foundations of Computer Science 1995: 20th International …, 1995
421995
Assembling molecules in ATOMIX is hard
M Holzer, S Schwoon
Theoretical computer science 313 (3), 447-462, 2004
412004
On the complexities of linear LL (1) and LR (1) grammars
M Holzer, KJ Lange
Fundamentals of Computation Theory: 9th International Conference, FCT'93 …, 1993
371993
Computational Complexity of NFA Minimization for Finite and Unary Languages.
H Gruber, M Holzer
LATA 8, 261-272, 2007
352007
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
352001
The system can't perform the operation now. Try again later.
Articles 1–20