Folgen
Markus Holzer
Markus Holzer
Professor für Informatik, Universität Giessen
Bestätigte E-Mail-Adresse bei in.tum.de
Titel
Zitiert von
Zitiert von
Jahr
Descriptional and computational complexity of finite automata—A survey
M Holzer, M Kutrib
Information and Computation 209 (3), 456-470, 2011
1652011
Nondeterministic descriptional complexity of regular languages
M Holzer, M Kutrib
International Journal of Foundations of Computer Science 14 (06), 1087-1102, 2003
1532003
Finite automata, digraph connectivity, and regular expression size
H Gruber, M Holzer
International Colloquium on Automata, Languages, and Programming, 39-50, 2008
1012008
State complexity of basic operations on nondeterministic finite automata
M Holzer, M Kutrib
International Conference on Implementation and Application of Automata, 148-157, 2002
822002
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
782009
Descriptional complexity—an introductory survey
M Holzer, M Kutrib
Scientific Applications of Language Methods, 1-58, 2011
772011
On deterministic finite automata and syntactic monoid size
M Holzer, B König
Theoretical Computer Science 327 (3), 319-347, 2004
722004
Determination of finite automata accepting subregular languages
H Bordihn, M Holzer, M Kutrib
Theoretical Computer Science 410 (35), 3209-3222, 2009
642009
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
632001
Complexity of multi-head finite automata: Origins and directions
M Holzer, M Kutrib, A Malcher
Theoretical Computer Science 412 (1-2), 83-96, 2011
622011
Finding lower bounds for nondeterministic state complexity is hard
H Gruber, M Holzer
Developments in Language Theory: 10th International Conference, DLT 2006 …, 2006
592006
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
582009
Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
H Gruber, M Holzer
International Conference on Developments in Language Theory, 205-216, 2007
582007
Unary language operations and their nondeterministic state complexity
M Holzer, M Kutrib
International Conference on Developments in Language Theory, 162-172, 2002
572002
Automata that take advice
C Damm, M Holzer
International Symposium on Mathematical Foundations of Computer Science, 149-158, 1995
441995
Assembling molecules in ATOMIX is hard
M Holzer, S Schwoon
Theoretical computer science 313 (3), 447-462, 2004
432004
The complexity of tensor calculus
C Damm, M Holzer, P McKenzie
computational complexity 11, 54-89, 2002
402002
On the complexities of linear LL (1) and LR (1) grammars
M Holzer, KJ Lange
International Symposium on Fundamentals of Computation Theory, 299-308, 1993
391993
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
362001
On Emptiness and Counting for Alternating Finite Automata.
M Holzer
Developments in Language Theory, 88-97, 1995
361995
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20