The following pages link to Markus Holzer (Q198230):
Displaying 17 items.
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Minimal and hyper-minimal biautomata (Q5890813) (← links)
- Minimal and Hyper-Minimal Biautomata (Q5891816) (← links)
- Properties of right one-way jumping finite automata (Q5896090) (← links)
- More on the Size of Higman-Haines Sets: Effective Constructions (Q5901451) (← links)
- More on the Size of Higman-Haines Sets: Effective Constructions (Q5902078) (← links)
- Properties of right one-way jumping finite automata (Q5919708) (← links)
- Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization (Q5941286) (← links)
- The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case (Q6070753) (← links)
- Advanced Automatic Code Generation for Multiple Relaxation-Time Lattice Boltzmann Methods (Q6095428) (← links)
- Input-Driven Double-Head Pushdown Automata (Q6114870) (← links)
- Optimal Regular Expressions for Palindromes of Given Length (Q6168470) (← links)
- On the accepting state complexity of operations on permutation automata (Q6186540) (← links)
- (Q6187048) (← links)
- On Minimal Pumping Constants for Regular Languages (Q6204130) (← links)
- Development of a central-moment phase-field lattice Boltzmann model for thermocapillary flows: droplet capture and computational performance (Q6615732) (← links)
- On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) (Q6666794) (← links)
