{"paper":{"title":"The Complexity of Transducer Synthesis from Multi-Sequential Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Isma\\\"el Jecker, L\\'eo Exibard","submitted_at":"2019-05-09T12:09:52Z","abstract_excerpt":"The transducer synthesis problem on finite words asks, given a specification $S \\subseteq I \\times O$, where $I$ and $O$ are sets of finite words, whether there exists an implementation $f: I \\rightarrow O$ which (1) fulfils the specification, i.e., $(i,f(i))\\in S$ for all $i\\in I$, and (2) can be defined by some input-deterministic (aka sequential) transducer $\\mathcal{T}_f$. If such an implementation $f$ exists, the procedure should also output $\\mathcal{T}_f$. The realisability problem is the corresponding decision problem.\n  For specifications given by synchronous transducers (which read a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03560","kind":"arxiv","version":1},"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"}