23 citations · 28 across the 12 of their papers we have counts for
12 papers
On some Open Problems for Finite Automata with Translucent Input Letters
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Finite automata with translucent input letters are a recent model of discontinuous input processing. Basically, classical finite automata are equipped with a translucency function…
Complexity of Unary Exclusive Nondeterministic Finite Automata
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Exclusive nondeterministic finite automata (XNFA) are nondeterministic finite automata with a special acceptance condition. An input is accepted if there is exactly one accepting p…
Reversible Two-Party Computations
Martin Kutrib, Andreas Malcher
Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform…
Reversible Computations of One-Way Counter Automata
Martin Kutrib, Andreas Malcher
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backw…
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers
Martin Kutrib, Andreas Malcher, Carlo Mereghetti +1
An iterated uniform finite-state transducer (IUFST) runs the same length-preserving transduction, starting with a sweep on the input string and then iteratively sweeping on the out…
Input-Driven Double-Head Pushdown Automata
Markus Holzer, Martin Kutrib, Andreas Malcher +1
We introduce and study input-driven deterministic and nondeterministic double-head pushdown automata. A double-head pushdown automaton is a slight generalization of an ordinary pus…