Tree-structured problems and parallel computation
M Ludwig - 2019 - tobias-lib.ub.uni-tuebingen.de
Tree-Structured Problems and Parallel Computation Page 1 Tree-Structured Problems and Parallel
Computation Dissertation der Mathematisch-Naturwissenschaftlichen Fakultät der Eberhard …
Computation Dissertation der Mathematisch-Naturwissenschaftlichen Fakultät der Eberhard …
Better complexity bounds for cost register automata
E Allender, A Krebs, P McKenzie - Theory of computing systems, 2019 - Springer
Cost register automata (CRAs) are one-way finite automata whose transitions have the side
effect that a register is set to the result of applying a state-dependent semiring operation to a …
effect that a register is set to the result of applying a state-dependent semiring operation to a …
Automata with auxiliary weights
P Kostolányi, B Rovan - International Journal of Foundations of …, 2016 - World Scientific
We introduce a new generalization of weighted automata–automata with auxiliary weights.
They allow to compute several quantities not directly computable over semirings by …
They allow to compute several quantities not directly computable over semirings by …
On deterministic weighted automata
P Kostolányi - Information Processing Letters, 2018 - Elsevier
Two families of input-deterministic weighted automata over semirings are considered: purely
sequential automata, in which terminal weights of states are either zero or unity, and …
sequential automata, in which terminal weights of states are either zero or unity, and …
[PDF][PDF] Better Complexity Bounds for Cost Register Machines
E Allender, A Krebs, P McKenzie - Electronic Colloquium on …, 2017 - academia.edu
Cost register automata (CRAs) are one-way finite automata whose transitions have the side
effect that a register is set to the result of applying a state-dependent semiring operation to a …
effect that a register is set to the result of applying a state-dependent semiring operation to a …