Visibly Recursive Automata
Formal Languages and Automata Theory
2026-05-12 v2 Computational Complexity
Abstract
As an alternative to visibly pushdown automata, we introduce visibly recursive automata (VRAs), composed of a set of classical automata that can call each other. VRAs are a strict extension of so-called systems of procedural automata, a model proposed by Frohme and Steffen. We study the complexity of standard language-theoretic operations and classical decision problems for VRAs. Since the class of deterministic VRAs forms a strict subclass in terms of expressiveness, we propose a (weaker) notion that does not restrict expressive power and which we call codeterminism. Codeterminism comes with many desirable algorithmic properties that we demonstrate by using it, e.g., as a stepping stone towards implementing complementation of VRAs.
Keywords
Cite
@article{arxiv.2603.11648,
title = {Visibly Recursive Automata},
author = {Kévin Dubrulle and Véronique Bruyère and Guillermo A. Pérez and Gaëtan Staquet},
journal= {arXiv preprint arXiv:2603.11648},
year = {2026}
}