collaborators

1 paper

cs.FL2025

Jump Complexity of Deterministic Finite Automata with Translucent Letters

Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Păun +1

We investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for s…