The following pages link to Markus Holzer (Q198230):
Displaying 50 items.
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- A mesh of automata (Q2272980) (← links)
- The range of state complexities of languages resulting from the cut operation (Q2278275) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- The chop of languages (Q2358686) (← links)
- On the number of active states in deterministic and nondeterministic finite automata (Q2399248) (← links)
- One-time nondeterministic computations (Q2401000) (← links)
- On regular expression proof complexity (Q2408794) (← links)
- Operational state complexity and decidability of jumping finite automata (Q2408795) (← links)
- On the mother of all automata: the position automaton (Q2408798) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- The complexity of tensor circuit evaluation (Q2472427) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- Cooperating distributed grammar systems with non-terminating components (Q2708974) (← links)
- On fixed and general membership for external and internal contextual languages (Q2708979) (← links)
- Grammar systems with negated conditions in their cooperation protocols (Q2709225) (← links)
- Bidirectional cooperating distributed grammar systems (Q2770675) (← links)
- A generalization of the flip-flop lemma (Q2770679) (← links)
- Reversible Shrinking Two-Pushdown Automata (Q2798750) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- The finite index restriction meets hybrid modes in cooperating distributed grammar systems (Q2800417) (← links)
- Minimization and characterizations for biautomata (Q2805401) (← links)
- On measuring non-recursive trade-offs (Q2819383) (← links)
- Hairpin finite automata (Q2819402) (← links)
- The Degree of Irreversibility in Deterministic Finite Automata (Q2830203) (← links)
- Nondeterministic Biautomata and Their Descriptional Complexity (Q2843089) (← links)
- The complexity of regular(-like) expressions (Q2909093) (← links)
- The magic number problem for subregular language families (Q2909186) (← links)
- Input-Driven Stack Automata (Q2915157) (← links)
- Tight Bounds for Cut-Operations on Deterministic Finite Automata (Q2945878) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence (Q3009338) (← links)
- (Q3022293) (← links)
- Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction (Q3067482) (← links)
- Computational Complexity of NURIKABE (Q3100933) (← links)
- (Q3102144) (← links)
- On iterated dominance, matrix elimination, and matched paths (Q3113741) (← links)
- A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems (Q3166945) (← links)
- Generalized Derivations with Synchronized Context-Free Grammars (Q3167488) (← links)
- From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors (Q3167495) (← links)
- On Inverse Operations and Their Descriptional Complexity (Q3167574) (← links)
- State Complexity of Chop Operations on Unary and Finite Languages (Q3167580) (← links)
- Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms (Q3301012) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- (Q3396003) (← links)
- ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING (Q3401491) (← links)
- (Q3416094) (← links)
- (Q3431234) (← links)
- Minimal Reversible Deterministic Finite Automata (Q3451109) (← links)
