arXiv (All)
open access
Formal Grammars and Generating Functions: From Algebraic Structure to Non-Algebraic and Non-Derivable Series
This paper investigates how the algebraic and analytic properties of ordinary length generating functions constrain the grammatical and computational complexity of formal languages. We review the Chomsky-Schutzenberger representation, DSV translations for unambiguous context-free grammars, and their
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
- Mistake-Bounded Language Generation#175268
- Discourse Function and Syntactic Form in Natural Language Generation#341480
- Syntactical Treatment of Modalities, 6 February#119099
Record · ID 1455592
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