M
Markus Holzer
Researcher at University of Giessen
Publications - 262
Citations - 3032
Markus Holzer is an academic researcher from University of Giessen. The author has contributed to research in topics: Deterministic finite automaton & Nondeterministic finite automaton. The author has an hindex of 27, co-authored 255 publications receiving 2871 citations. Previous affiliations of Markus Holzer include Technische Universität München & Université de Montréal.
Papers
More filters
Journal ArticleDOI
Nondeterministic descriptional complexity of regular languages
Markus Holzer,Martin Kutrib +1 more
TL;DR: Bounds are shown for Boolean operations, catenation operations – concatenation, iteration, λ-free iteration – and the reversal on finite and infinite regular languages over unary and arbitrary alphabets.
Journal ArticleDOI
Descriptional and computational complexity of finite automata---A survey
Markus Holzer,Martin Kutrib +1 more
TL;DR: This paper tours a fragment of a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept, and discusses developments relevant to infinite automata related problems like simulation of and by several types of finite Automata.
Book ChapterDOI
Finite Automata, Digraph Connectivity, and Regular Expression Size
Hermann Gruber,Markus Holzer +1 more
TL;DR: This work develops a different, more versatile lower bound technique that is based on the star height of regular languages, which is tied to cycle rank, a structural complexity measure for digraphs proposed by Eggan and Buchi, which measures the degree of connectivity of directed graphs.
Journal ArticleDOI
Symmetries and the complexity of pure Nash equilibrium
TL;DR: This work investigates the computational complexity of pure Nash equilibria in four classes of symmetric games obtained by considering two additional properties: identical payoff functions for all players and the ability to distinguish oneself from the other players.