{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:11:09Z","timestamp":1767237069737},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p> Nested words have been introduced by Alur and Madhusudan as a model for e.g. recursive programs or XML documents and have received much recent interest. In this paper, we investigate a quantitative automaton model and a quantitative logic for nested words. The behavior resp. the semantics map nested words to weights which are taken from a strong bimonoid. Strong bimonoids can be viewed as semirings without requiring the distributivity assumption which was essential in the classical theory of formal power series; strong bimonoids include e.g. all bounded lattices and many other structures from multi-valued logics. Our main results show that weighted nested word automata and suitable weighted MSO logics are expressively equivalent. This extends the classical B\u00fcchi-Elgot result from words to a weighted setting for nested words. <\/jats:p>","DOI":"10.1142\/s0129054114500269","type":"journal-article","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T09:11:47Z","timestamp":1409303507000},"page":"641-666","source":"Crossref","is-referenced-by-count":2,"title":["WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS"],"prefix":"10.1142","volume":"25","author":[{"given":"MANFRED","family":"DROSTE","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Leipzig, D-04009 Leipzig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BUNDIT","family":"PIBALJOMMEE","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Khon Kaen University, Khon Kaen 40002, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,8,29]]},"reference":[{"issue":"11","key":"p_1","first-page":"1","volume":"4","author":"Alur R.","year":"2008","journal-title":"Log. Meth. Comput. Sci. 4"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.2307\/1968621"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.05.020"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.055"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.09.003"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.11.008"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-010-0003-2"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-6(1:5)2010"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00115-7"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2003.11.003"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.026"},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1003642222321"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.04.001"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114500269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:29:54Z","timestamp":1565123394000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114500269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":14,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2014,8,29]]},"published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.1142\/S0129054114500269"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114500269","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}