Problem
Research questions and friction points this paper is trying to address.
Picture-walking automata
Nondeterministic finite automata
Boundary crossing
Computational power
Thinking outside the box is useless NFA = FNFA
🤖 AI Summary
This study addresses the long-standing open problem of whether out-of-bound access enhances the computational power of nondeterministic walking automata on high-dimensional images. Grounded in formal language and automata theory, this work establishes through rigorous mathematical proof that out-of-bound nondeterministic finite automata (FNFA) are computationally equivalent to standard nondeterministic finite automata (NFA) in arbitrary dimensions. This result definitively resolves a classical conjecture in the field by demonstrating that boundary-crossing mechanisms do not augment the model's computational capabilities. Consequently, these findings provide a critical theoretical foundation for high-dimensional automata theory, clarifying the fundamental limits of spatial computation models and settling debates regarding the necessity of extended boundary conditions in multidimensional recognition tasks.
📝 Abstract
We study picture-walking automata, namely finite-state automata that accept higher-dimensional parallelotope-/tensor-shaped pictures and are allowed to move in all directions depending on their current state and the currently read symbol. It is a long-standing open problem whether the nondeterministic such automata become stronger if automata are allowed to exit the picture. In this paper, we resolve the problem in full generality: NFA = FNFA, for pictures of any dimension.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Picture-walking automata
NFA = FNFA
Higher-dimensional pictures
Open problem resolution
🔎 Similar Papers
No similar papers found.
