Descriptional and computational complexity of finite automata—A survey von Holzer, Markus, Kutrib, Martin

Volltext

Energy-Efficient Implementation of the Lattice Boltzmann Method von Vysocky, Ondrej, Holzer, Markus, Staffelbach, Gabriel, Vavrik, Radim, Riha, Lubomir

Volltext

Complexity of multi-head finite automata: Origins and directions von Holzer, Markus, Kutrib, Martin, Malcher, Andreas

Volltext

Nondeterministic right one-way jumping finite automata von Beier, Simon, Holzer, Markus

Volltext

Properties of right one-way jumping finite automata von Beier, Simon, Holzer, Markus

Volltext

On the Descriptional Complexity of Operations on Semilinear Sets von Beier, Simon, Holzer, Markus, Kutrib, Martin

Volltext

On the accepting state complexity of operations on permutation automata von Rauch, Christian, Holzer, Markus

Volltext

Input-Driven Double-Head Pushdown Automata von Holzer, Markus, Kutrib, Martin, Malcher, Andreas, Wendlandt, Matthias

Volltext

On Minimal Pumping Constants for Regular Languages von Holzer, Markus, Rauch, Christian

Volltext

From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity von Gruber, Hermann, Holzer, Markus

Volltext

On the Accepting State Complexity of Operations on Permutation Automata von Rauch, Christian, Holzer, Markus

Volltext

More Structural Characterizations of Some Subregular Language Families by Biautomata von Holzer, Markus, Jakobi, Sebastian

Volltext

Comparison of free-surface and conservative Allen–Cahn phase-field lattice Boltzmann method von Schwarzmeier, Christoph, Holzer, Markus, Mitchell, Travis, Lehmann, Moritz, Häusl, Fabian, Rüde, Ulrich

Volltext

On deterministic finite automata and syntactic monoid size von Holzer, Markus, König, Barbara

Volltext

Advanced Automatic Code Generation for Multiple Relaxation-Time Lattice Boltzmann Methods von Hennig, Frederik, Holzer, Markus, Rüde, Ulrich

Volltext

On the computational complexity of problems related to distinguishability sets von Holzer, Markus, Jakobi, Sebastian

Volltext

Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP von Gruber, Hermann, Holzer, Markus

Volltext

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract) von Beier, Simon, Holzer, Markus

Volltext

On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers von Nagy, Benedek, Kovács, Zita

Volltext

Analytical performance estimation during code generation on modern GPUs von Ernst, Dominik, Holzer, Markus, Hager, Georg, Knorr, Matthias, Wellein, Gerhard

Volltext