arXiv (All)
open access
On the equivalence between generating functions computed by memory transducers and enumerating functions produced by indexed grammars
We consider the sequences of natural integers that can be computed by a deterministic transducer, with input in a structure A, output in N. and with memory the set of stacks of stacks of A. We show that these sequences are, exactly, the counting sequences of formal languages generated by unambiguous
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
- Polynomial-Time Mistake-Bounded Language Generation#665815
- Polynomial-Time Mistake-Bounded Language Generation#664315
- Filters in abstract aggregation with infinite sequences of signals#427317
- Mistake-Bounded Language Generation#175268
- The Attribution Contract for Generative Language Models#677608
Record · ID 971961
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