Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs

Olga Martynova 0001. Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Inf. Comput., 296:105127, January 2024. [doi]

Abstract

Abstract is missing.