{"paper":{"title":"On Delay and Regret Determinization of Max-Plus Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LO"],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Guillermo A. P\\'erez, Isma\\\"el Jecker, Jean-Fran\\c{c}ois Raskin, Nathan Lhote","submitted_at":"2017-01-11T09:48:53Z","abstract_excerpt":"Decidability of the determinization problem for weighted automata over the semiring $(\\mathbb{Z} \\cup {-\\infty}, \\max, +)$, WA for short, is a long-standing open question. We propose two ways of approaching it by constraining the search space of deterministic WA: k-delay and r-regret. A WA N is k-delay determinizable if there exists a deterministic automaton D that defines the same function as N and for all words {\\alpha} in the language of N, the accepting run of D on {\\alpha} is always at most k-away from a maximal accepting run of N on {\\alpha}. That is, along all prefixes of the same lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02903","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}