arXiv (All)open access
Construction of a DFA for Computing Grundy Numbers in the Successful Derivation Games on Right-Linear Grammars
formal languages and automata theory, computer science and game theory
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 820873
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.