arXiv (All)
open access
Recognizers for Graph-Encoding Languages
computational-complexitydiscrete-mathematicsf-4-1formal-languages-and-automata-theoryg-2-2logic-in-computer-science
We introduce recurrent incidence automata (RIAs), a new automaton model motivated by a decomposition of certain two-stack visibly pushdown computations. The decomposition separates vertex-local finite-state computations from recurrent one-stack interfaces connecting consecutive vertices. The constru
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Explorable Parity Automata#1011984
- An Improved Lower Bound for Separating Words by Permutation Automata#1248025
- DataAtlas: automatic generation of data dictionaries using large language models.#320606
- Languages, machines, and classical computation#117792
- Extending QuAK with nested quantitative automata#677874
Record · ID 1215829
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive