{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T03:11:53Z","timestamp":1652929913890},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p> Let [Formula: see text] be a complete star-omega semiring and [Formula: see text] be an alphabet. For a weighted [Formula: see text]-pushdown automaton [Formula: see text] with stateset [Formula: see text], [Formula: see text], we show that there exists a mixed algebraic system over a complete semiring-semimodule pair [Formula: see text] such that the behavior [Formula: see text] of [Formula: see text] is a component of a solution of this system. In case the basic semiring is [Formula: see text] or [Formula: see text] we show that there exists a mixed context-free grammar that generates [Formula: see text]. The construction of the mixed context-free grammar from [Formula: see text] is a generalization of the well known triple construction and is called now triple-pair construction for [Formula: see text]-pushdown automata. <\/jats:p>","DOI":"10.1142\/s0129054122410039","type":"journal-article","created":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T16:01:11Z","timestamp":1649606471000},"page":"227-246","source":"Crossref","is-referenced-by-count":0,"title":["The Triple-Pair Construction for Weighted \u03c9-Pushdown Automata"],"prefix":"10.1142","volume":"33","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[{"name":"Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[{"name":"Department of Foundations of Computer Science, University of Szeged, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Kuich","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Institut f\u00fcr Diskrete Mathematik und Geometrie, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"S0129054122410039BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9"},{"key":"S0129054122410039BIB002","volume-title":"Theoretische Grundlagen der Programmiersprachen","author":"Bucher W.","year":"1984"},{"key":"S0129054122410039BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80004-4"},{"key":"S0129054122410039BIB004","volume-title":"Regular Algebra and Finite Machines","author":"Conway J. H.","year":"1971"},{"issue":"1","key":"S0129054122410039BIB005","first-page":"1","volume":"14","author":"Droste M.","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"S0129054122410039BIB006","series-title":"Pure and Applied Mathematics","volume-title":"Automata, Languages, and Machines","volume":"59","author":"Eilenberg S.","year":"1974"},{"key":"S0129054122410039BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(76)90106-X"},{"key":"S0129054122410039BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27812-2_7"},{"key":"S0129054122410039BIB010","first-page":"243","volume":"10","author":"\u00c9sik Z.","year":"2005","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"S0129054122410039BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-007-0709-7"},{"issue":"4","key":"S0129054122410039BIB012","first-page":"435","volume":"12","author":"\u00c9sik Z.","year":"2007","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"S0129054122410039BIB013","doi-asserted-by":"publisher","DOI":"10.14232\/actacyb.23.1.2017.5"},{"key":"S0129054122410039BIB014","volume-title":"Introduction to Formal Language Theory","author":"Harrison M. A.","year":"1978","edition":"1"},{"key":"S0129054122410039BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_9"},{"key":"S0129054122410039BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7"},{"key":"S0129054122410039BIB017","series-title":"Pure and Applied Mathematics","volume-title":"Infinite Words: Automata, Semigroups, Logic and Games","volume":"141","author":"Perrin D.","year":"2004"},{"key":"S0129054122410039BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122410039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T02:56:55Z","timestamp":1652929015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122410039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":17,"journal-issue":{"issue":"03n04","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1142\/S0129054122410039"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122410039","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}