Author Info
Name
Affiliation
Papers
MARKUS HOLZER
Institut für Informatik, Technische Universität München, Garching bei München, Germany
21
Collaborators
Citations 
PageRank 
17
138
12.30
Referers 
Referees 
References 
148
230
173
Search Limit
100230
Title
Citations
PageRank
Year
Minimal Reversible Deterministic Finite Automata00.342018
On bonded sequential and parallel insertion systems.00.342018
More on Deterministic and Nondeterministic Finite Cover Automata00.342017
On the Number of Active States in Deterministic and Nondeterministic Finite Automata.00.342017
Reversible Shrinking Two-Pushdown Automata.10.352016
Minimal and Hyper-Minimal Biautomata00.342016
The Finite Index Restriction Meets Hybrid Modes In Cooperating Distributed Grammar Systems00.342015
Minimal and Hyper-Minimal Biautomata - (Extended Abstract).00.342014
On the average state and transition complexity of finite languages80.692007
Sorting the slow way: an analysis of perversely awful randomized sorting algorithms30.652007
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract).00.342006
The size of Higman-Haines sets140.812006
A common algebraic description for probabilistic and quantum computations20.412005
On timed automata with discrete time – structural and language theoretical characterization10.352005
Unsolvability Levels Of Operation Problems For Subclasses Of Context-Free Languages40.532005
Nondeterministic Descriptional Complexity of Regular Languages792.912003
On the descriptional complexity of finite automata with modified acceptance conditions00.342003
Flip-pushdown automata: k + 1 pushdown reversals are better than k201.282003
On the Computational Complexity of Synchronized Context-Free Languages30.522002
Economy of description for basic constructions on rational transductions30.422002
Cooperating distributed grammar systems with non-terminating components00.341999