{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:51:34Z","timestamp":1766087494894,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-3","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>Multiset finite Automata, a model equivalent to regular commutative\n\t\t\t grammars, are extended with a multiset store and the accepting power of this\n\t\t\t extended model of computation is investigated. This type of multiset automata\n\t\t\t come in two flavours, varying only in the ability of testing the storage for\n\t\t\t emptiness. This paper establishes normal forms and relates the derived language\n\t\t\t classes to each other as well as to known multiset language classes.<\/jats:p>","DOI":"10.3233\/fi-2009-0098","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T03:43:52Z","timestamp":1575344632000},"page":"221-233","source":"Crossref","is-referenced-by-count":13,"title":["Multiset Pushdown Automata"],"prefix":"10.1177","volume":"93","author":[{"given":"Manfred","family":"Kudlek","sequence":"first","affiliation":[{"name":"Department Informatik, MIN Fakult\u00e4t\r\t\t\t Universit\u00e4t Hamburg Vogt-K\u00f6lln-Stra\u00dfe 30, D-22527 Hamburg,\r\t\t\t Germany. {kudlek,3totzke,3zetzsch}@informatik.uni-hamburg.de"}]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[{"name":"Department Informatik, MIN Fakult\u00e4t\r\t\t\t Universit\u00e4t Hamburg Vogt-K\u00f6lln-Stra\u00dfe 30, D-22527 Hamburg,\r\t\t\t Germany. {kudlek,3totzke,3zetzsch}@informatik.uni-hamburg.de"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"Department Informatik, MIN Fakult\u00e4t\r\t\t\t Universit\u00e4t Hamburg Vogt-K\u00f6lln-Stra\u00dfe 30, D-22527 Hamburg,\r\t\t\t Germany. {kudlek,3totzke,3zetzsch}@informatik.uni-hamburg.de"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0098","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:56:05Z","timestamp":1751367365000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-0098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.3233\/FI-2009-0098"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-0098","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}