{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T17:23:27Z","timestamp":1765819407344,"version":"3.48.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Automata, Logic and Semantics","license":[{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,10,26]]},"abstract":"<jats:p>We answer an open question in the theory of transducer degrees on the existence of a diamond structure in the transducer hierarchy. Transducer degrees are the equivalence classes formed by word transformations which can be realized by a finite state transducer, which form an order based on which words can be transformed into other words. We provide a construction which proves the existence of a diamond structure, while also introducing a new function on streams which may be useful for proving more results about the transducer hierarchy.<\/jats:p>","DOI":"10.46298\/dmtcs.8704","type":"journal-article","created":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T17:20:06Z","timestamp":1765819206000},"source":"Crossref","is-referenced-by-count":0,"title":["A Diamond Structure in the Transducer Hierarchy"],"prefix":"10.46298","volume":"vol. 27:3","author":[{"given":"Noah","family":"Kaufmann","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,12,15]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2111.05481v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2111.05481v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T17:20:07Z","timestamp":1765819207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dmtcs.episciences.org\/8704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,15]]},"references-count":0,"journal-issue":{"issue":"Automata, Logic and Semantics","published-online":{"date-parts":[[2025,12,15]]}},"URL":"https:\/\/doi.org\/10.46298\/dmtcs.8704","relation":{"has-preprint":[{"id-type":"arxiv","id":"2111.05481v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2111.05481v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2111.05481v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2111.05481","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2111.05481","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,15]]},"article-number":"8704"}}