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.FL2026
Proceedings of the 16th International Workshop on Non-Classical Models of Automata and Applications
Cezar Câmpeanu, Martin Kutrib, Sylvain Lombardy
The Sixteenth International Workshop on Non-Classical Models of Automata and Applications (NCMA 2026) was held in Rouen, France, on June 29 and 30, 2026, organized by the Universit…
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…