3 papers
cs.FL2026
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…
cs.FL2024
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…
cs.FL2017
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…