{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:46:31Z","timestamp":1648770391825},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p> The article surveys some decidability results concerning simplification problems for DPDAs on infinite words (\u03c9-DPDAs). We summarize some recent results on the regularity problem, which asks for a given \u03c9-DPDA, whether its language can also be accepted by a finite automaton. The results also give some insights on the equivalence problem for a subclass of \u03c9-DPDA. Furthermore, we present some new results on the parity index problem for \u03c9-DPDAs. For the specification of a parity condition, the states of the \u03c9-DPDA are assigned priorities (natural numbers), and a run is accepting if the highest priority that appears infinitely often during a run is even. The basic simplification question asks whether one can determine the minimal number of priorities that are needed to accept the language of a given \u03c9-DPDA. We provide some decidability results on variations of this question for some classes of \u03c9-DPDAs. <\/jats:p>","DOI":"10.1142\/s0129054115400122","type":"journal-article","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T03:50:41Z","timestamp":1456372241000},"page":"1041-1068","source":"Crossref","is-referenced-by-count":0,"title":["Simplification Problems for Deterministic Pushdown Automata on Infinite Words"],"prefix":"10.1142","volume":"26","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[{"name":"Lehrstuhl Informatik 7, RWTH Aachen University, 52056 Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,2,24]]},"reference":[{"key":"p_2","first-page":"202","author":"Alur R.","year":"2004","journal-title":"New York, USA"},{"issue":"6","key":"p_5","first-page":"495","volume":"33","author":"Carton O.","year":"1999","journal-title":"ITA"},{"issue":"3","key":"p_6","first-page":"275","volume":"16","author":"Cohen R. S.","year":"1978","journal-title":"JCSS"},{"key":"p_8","first-page":"132","author":"Fridman W.","year":"2010","journal-title":"Theoretical Computer Science"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90058-5"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_34"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00285-1"},{"issue":"3","key":"p_18","first-page":"434","volume":"27","author":"Staiger L.","year":"1983","journal-title":"JCSS"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90591-8"},{"key":"p_22","first-page":"133","author":"Thomas W.","year":"1990","journal-title":"Amsterdam"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1145\/321864.321865"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2894"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054115400122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:00:43Z","timestamp":1565118043000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054115400122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":12,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2016,2,24]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S0129054115400122"],"URL":"https:\/\/doi.org\/10.1142\/s0129054115400122","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}