{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiesixbddgcvhjcx6yryyy7s7mwbenjf2aqgwod3sue4nahrdqicpy",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mgw2p2yfetl2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.11648v1",
  "publishedAt": "2026-03-13T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Kévin Dubrulle",
    "Véronique Bruyère",
    "Guillermo A. Pérez",
    "Gaëtan Staquet"
  ],
  "textContent": "**Authors:** Kévin Dubrulle, Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet\n\nAs 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.",
  "title": "Visibly Recursive Automata"
}