{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:27:40Z","timestamp":1648762060807},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2016,2]]},"abstract":"<jats:p> Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced oto model transformations of nested words, i.e. words with a call\/return structure. When outputs are also structured and well nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. We prove the class of VPTs with well-nested outputs to be decidable in PTIME. Moreover, we show that this class is closed under composition and that its type-checking against visibly pushdown languages is decidable. <\/jats:p>","DOI":"10.1142\/s0129054116400086","type":"journal-article","created":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T08:25:46Z","timestamp":1462350346000},"page":"235-257","source":"Crossref","is-referenced-by-count":2,"title":["Visibly Pushdown Transducers with Well-Nested Outputs"],"prefix":"10.1142","volume":"27","author":[{"given":"Pierre-Alain","family":"Reynier","sequence":"first","affiliation":[{"name":"Aix Marseille Universit\u00e9, CNRS, LIF UMR 7279, 13288, Marseille, France"}]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[{"name":"Aix Marseille Universit\u00e9, CNRS, LIF UMR 7279, 13288, Marseille, France"}]}],"member":"219","published-online":{"date-parts":[[2016,5,4]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516518"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008040"},{"key":"p_4","first-page":"40","volume":"158","author":"Braunm\u00fchl B. V.","year":"1983","journal-title":"LNCS"},{"key":"p_7","first-page":"355","volume":"6281","author":"Filiot E.","year":"2010","journal-title":"LNCS"},{"key":"p_8","first-page":"386","volume":"5126","author":"Raskin J.-F.","year":"2008","journal-title":"LNCS"},{"key":"p_10","first-page":"310","volume":"5699","author":"Staworko S.","year":"2009","journal-title":"LNCS"},{"key":"p_11","first-page":"346","volume":"4423","author":"Tozawa A.","year":"2007","journal-title":"LNCS"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054116400086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:02:46Z","timestamp":1565118166000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054116400086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":7,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,4]]},"published-print":{"date-parts":[[2016,2]]}},"alternative-id":["10.1142\/S0129054116400086"],"URL":"https:\/\/doi.org\/10.1142\/s0129054116400086","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}