{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:40:48Z","timestamp":1648705248948},"reference-count":22,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.151.4","type":"journal-article","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T21:31:46Z","timestamp":1400621506000},"page":"55-73","source":"Crossref","is-referenced-by-count":0,"title":["Decision Problems for Deterministic Pushdown Automata on Infinite Words"],"prefix":"10.4204","volume":"151","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"key":"AM2004VPL","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/1007352.1007390","article-title":"Visibly pushdown languages","volume-title":"STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","author":"Alur","year":"2004"},{"key":"BaierK08","volume-title":"Principles of Model Checking","author":"Baier","year":"2008"},{"key":"CDT2002a","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-45793-3_22","article-title":"Solving Pushdown Games with a \u03a3_3 Winning Condition","volume-title":"Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002","volume":"2471","author":"Cachat","year":"2002"},{"issue":"6","key":"Carton99","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1051\/ita:1999129","article-title":"Computing the Rabin Index of a Parity Automaton","volume":"33","author":"Carton","year":"1999","journal-title":"ITA"},{"issue":"3","key":"CohenG78","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0022-0000(78)90019-3","article-title":"Omega-Computations on Deterministic Pushdown Machines","volume":"16","author":"Cohen","year":"1978","journal-title":"JCSS"},{"key":"EsparzaHRS00","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","article-title":"Efficient Algorithms for Model Checking Pushdown Systems","volume-title":"CAV","author":"Esparza","year":"2000"},{"key":"Fridman10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.4204\/EPTCS.25.14","article-title":"Formats of Winning Strategies for Six Types of Pushdown Games","volume-title":"Proceedings of the First Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010","volume":"25","author":"Fridman","year":"2010"},{"key":"GTW2002","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]","volume":"2500","year":"2002"},{"key":"HopcroftU79","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"1","key":"Linna77","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(77)90058-5","article-title":"A Decidability Result for Deterministic\u0131t omega-Context-Free Languages","volume":"4","author":"Linna","year":"1977","journal-title":"Theor. Comput. Sci."},{"key":"LMS2004VPG","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-30538-5_34","article-title":"Visibly pushdown games","volume-title":"FSTTCS 2004","volume":"3328","author":"L\u00f6ding","year":"2004"},{"key":"LodingR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-642-32589-2_66","article-title":"Regularity Problems for Weak Pushdown \u03c9-Automata and Games","volume-title":"Mathematical Foundations of Computer Science 2012","volume":"7464","author":"L\u00f6ding","year":"2012"},{"key":"PerrinP04","series-title":"Pure and Applied Mathematics","volume-title":"Infinite words","volume":"141","author":"Perrin","year":"2004"},{"key":"RepkeDiss","volume-title":"Simplification Problems for Automata and Games","author":"Repke","year":"2014"},{"key":"Senizergues01","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00285-1","article-title":"L(A)=L(B)? decidability results from complete formal systems","volume":"251","author":"S\u00e9nizergues","year":"2001","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"Staiger83","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","article-title":"Finite-State \u03c9-Languages","volume":"27","author":"Staiger","year":"1983","journal-title":"JCSS"},{"issue":"3","key":"Stearns67","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","article-title":"A Regularity Test for Pushdown Machines","volume":"11","author":"Stearns","year":"1967","journal-title":"Information and Control"},{"key":"S2006DA","volume-title":"Deterministic Visibly Pushdown Automata over Infinite Words","author":"Stephan","year":"2006"},{"key":"Straubing94","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"Straubing","year":"1994"},{"issue":"1","key":"Valiant75","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321864.321865","article-title":"Regularity and Related Problems for Deterministic Pushdown Automata","volume":"22","author":"Valiant","year":"1975","journal-title":"J. ACM"},{"key":"Wadge84","volume-title":"Reducibility and Determinateness on the Baire Space","author":"Wadge","year":"1984"},{"issue":"2","key":"Walukiewicz01","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","article-title":"Pushdown Processes: Games and Model Checking","volume":"164","author":"Walukiewicz","year":"2001","journal-title":"Information and Computation"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2014,5,23]],"date-time":"2014-05-23T01:51:47Z","timestamp":1400809907000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/arxiv.org\/abs\/1405.5596v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,21]]},"references-count":22,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.4204\/eptcs.151.4","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,21]]}}}