{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:04:26Z","timestamp":1648724666470},"reference-count":12,"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":[[2017,8]]},"abstract":"<jats:p> We show how to train a weighted regular tree grammar such that it best approximates a weighted linear context-free tree grammar concerning the Kullback\u2013Leibler divergence between both grammars. Furthermore, we construct a regular tree grammar that approximates the tree language induced by a context-free tree grammar. <\/jats:p>","DOI":"10.1142\/s0129054117400056","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T08:31:43Z","timestamp":1513326703000},"page":"523-542","source":"Crossref","is-referenced-by-count":0,"title":["Regular Approximation of Weighted Linear Context-Free Tree Languages"],"prefix":"10.1142","volume":"28","author":[{"given":"Markus","family":"Teichmann","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"S0129054117400056BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1065"},{"key":"S0129054117400056BIB004","volume-title":"Tree Automata","author":"G\u00e9cseg F.","year":"1984"},{"key":"S0129054117400056BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744582"},{"key":"S0129054117400056BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_2"},{"key":"S0129054117400056BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.024"},{"key":"S0129054117400056BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-011-9134-0"},{"key":"S0129054117400056BIB009","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"S0129054117400056BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9470-7_12"},{"key":"S0129054117400056BIB012","doi-asserted-by":"publisher","DOI":"10.1162\/0891201054223986"},{"issue":"3","key":"S0129054117400056BIB014","first-page":"203","volume":"21","author":"Nederhof M.-J.","year":"2016","journal-title":"J.Automata, Lang. Comb."},{"key":"S0129054117400056BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/BF01695769"},{"key":"S0129054117400056BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/BF00630917"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117400056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T16:20:23Z","timestamp":1565194823000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117400056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":12,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2017,12,15]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S0129054117400056"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117400056","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}