arXiv (All)
open access
Construction of a DFA for Computing Grundy Numbers in the Successful Derivation Games on Right-Linear Grammars
Inoue et al. have introduced the successful derivation game (SDG) on context-free grammars (CFGs), which is a generalization of classic heap-based games including subtraction games and Keyles, and shown that the least upper bound of the Grundy numbers in the SDG on a given CFG G is undecidable in ge
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
- Gedanken: A tool for Pondering the Tractability of Correct Program Technology#1134029
- Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#793556
- Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#789552
- Numbers from Counting#689916
- Playing log(N)-Questions over Wikipedia Abstracts: How Per-Round Errors Compound Under Information Asymmetry#1034791
Record · ID 820873
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