The following pages link to Markus Holzer (Q198230):
Displaying 50 items.
- HYBRID EXTENDED FINITE AUTOMATA (Q3503090) (← links)
- Non-recursive trade-offs for deterministic restarting automata (Q3517104) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
- Deterministic Input-Reversal and Input-Revolving Finite Automata (Q3540102) (← links)
- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems (Q3540103) (← links)
- Extending regular expressions with homomorphic replacement (Q3566350) (← links)
- Automata that take advice (Q3569007) (← links)
- The Complexity of Regular(-Like) Expressions (Q3584879) (← links)
- Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata (Q3584958) (← links)
- Symmetries and the Complexity of Pure Nash Equilibrium (Q3590935) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Finding Lower Bounds for Nondeterministic State Complexity Is Hard (Q3617075) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Undecidability of Operation Problems for T0L Languages and Subclasses (Q3618583) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (Q3637336) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
- (Q4226188) (← links)
- (Q4284250) (← links)
- (Q4332157) (← links)
- (Q4412108) (← links)
- (Q4412117) (← links)
- (Q4412577) (← links)
- (Q4418610) (← links)
- (Q4449198) (← links)
- (Q4452075) (← links)
- (Q4452076) (← links)
- (Q4453201) (← links)
- (Q4458489) (← links)
- (Q4465334) (← links)
- (Q4531370) (← links)
- (Q4531373) (← links)
- (Q4536377) (← links)
- On the Computational Complexity of Partial Word Automata Problems (Q4589235) (← links)
- Tight Bounds for Cut-Operations on Deterministic Finite Automata* (Q4601149) (← links)
- The Degree of Irreversibility in Deterministic Finite Automata (Q4605511) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- (Q4662832) (← links)
- Structure and Complexity of Some Subregular Language Families (Q4683184) (← links)
- (Q4699306) (← links)
- (Q4737921) (← links)
- (Q4762636) (← links)
- (Q4779143) (← links)
- (Q4793127) (← links)
- (Q4886795) (← links)
- (Q4939195) (← links)
- (Q4939202) (← links)
- (Q4964015) (← links)
- (Q4988162) (← links)
