The following pages link to Markus Holzer (Q198230):
Displaying 50 items.
- (Q4994933) (← links)
- (Q4994948) (← links)
- (Q4994950) (← links)
- (Q5016357) (← links)
- (Q5016364) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- Parallel complexity of iterated morphisms and the arithmetic of small numbers (Q5096834) (← links)
- Inductive counting below logspace (Q5096885) (← links)
- (Q5145152) (← links)
- (Q5146524) (← links)
- Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY (Q5173289) (← links)
- (Q5178448) (← links)
- Descriptional Complexity of Chop Operations on Unary and Finite Languages. (Q5178453) (← links)
- Chop Operations and Expressions: Descriptional Complexity Considerations (Q5199970) (← links)
- Nodes Connected by Path Languages (Q5199972) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- One-Time Nondeterministic Computations (Q5205043) (← links)
- On bonded sequential and parallel insertion systems (Q5223612) (← links)
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines (Q5268394) (← links)
- CD grammar systems with competence based entry conditions in their cooperation protocols (Q5291780) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311156) (← links)
- (Q5313783) (← links)
- Brzozowski’s Minimization Algorithm—More Robust than Expected (Q5327494) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- ω-rational Languages: High Complexity Classes vs. Borel Hierarchy (Q5404928) (← links)
- (Q5422229) (← links)
- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms (Q5426025) (← links)
- The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake (Q5426026) (← links)
- Hairpin Finite Automata (Q5428224) (← links)
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP (Q5428232) (← links)
- LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS (Q5462668) (← links)
- Implementation and Application of Automata (Q5464010) (← links)
- Developments in Language Theory (Q5473669) (← links)
- Developments in Language Theory (Q5473678) (← links)
- (Q5486002) (← links)
- Fundamentals of Computation Theory (Q5492937) (← links)
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421) (← links)
- Boundary Sets of Regular and Context-Free Languages (Q5496186) (← links)
- On the Computational Complexity of Problems Related to Distinguishability Sets (Q5500686) (← links)
- (Q5507063) (← links)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
- Machines, Computations, and Universality (Q5710882) (← links)
- Developments in Language Theory (Q5711978) (← links)
- Developments in Language Theory (Q5711980) (← links)
- (Q5740421) (← links)
- Hybrid Extended Finite Automata (Q5757246) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)
