{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:55Z","timestamp":1751429455807,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"2-3","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p> We study weighted trace automata with weights in strong bimonoids. Traces form a generalization of words that allow to model concurrency; strong bimonoids are algebraic structures that can be regarded as \u201csemirings without distributivity\u201d. A very important example for the latter are bounded lattices, especially non-distributive ones. We show that if both operations of the bimonoid are locally finite, then the classes of recognizable and mc-rational trace series coincide and, in general, are properly contained in the class of c-rational series. Moreover, if, in addition, in the bimonoid the addition is idempotent and the multiplication is commutative, then all three classes coincide. <\/jats:p>","DOI":"10.3233\/fi-2011-586","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T04:51:47Z","timestamp":1575348707000},"page":"171-191","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Kleene-Sch\u00fctzenberger Theorem for Trace Series over Bounded Lattices"],"prefix":"10.1177","volume":"112","author":[{"given":"Martin","family":"Huschenbett","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Ilmenau, Germany. martin.huschenbett@tu-ilmenau.de"}]}],"member":"179","published-online":{"date-parts":[[2011,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-586","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:52:53Z","timestamp":1751367173000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":0,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.3233\/FI-2011-586"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-586","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}