@inproceedings(AM2004VPL, author = "Rajeev Alur and Parthasarathy Madhusudan", year = "2004", title = "Visibly pushdown languages", booktitle = "STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing", publisher = "ACM Press", address = "New York, NY, USA", pages = "202--211", doi = "10.1145/1007352.1007390", ) @book(BaierK08, author = "Christel Baier and Joost-Pieter Katoen", year = "2008", title = "Principles of Model Checking", publisher = "MIT Press", ) @inproceedings(CDT2002a, author = "T. Cachat and J. Duparc and W. Thomas", year = "2002", title = "Solving Pushdown Games with a {$\Sigma _3$} Winning Condition", booktitle = "Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002", series = "Lecture Notes in Computer Science", volume = "2471", publisher = "Springer", pages = "322--336", doi = "10.1007/3-540-45793-3\_22", ) @article(Carton99, author = "Olivier Carton and Ram{\'o}n Maceiras", year = "1999", title = "Computing the {R}abin Index of a Parity Automaton", journal = "ITA", volume = "33", number = "6", pages = "495--506", doi = "10.1051/ita:1999129", ) @article(CohenG78, author = "Rina S. Cohen and Arie Y. Gold", year = "1978", title = "Omega-Computations on Deterministic Pushdown Machines", journal = "JCSS", volume = "16", number = "3", pages = "275--300", doi = "10.1016/0022-0000(78)90019-3", ) @inproceedings(EsparzaHRS00, author = "Javier Esparza and David Hansel and Peter Rossmanith and Stefan Schwoon", year = "2000", title = "Efficient Algorithms for Model Checking Pushdown Systems", booktitle = "CAV", pages = "232--247", doi = "10.1007/10722167\_20", ) @inproceedings(Fridman10, author = "W. Fridman", year = "2010", title = "Formats of Winning Strategies for Six Types of Pushdown Games", editor = "A. Montanari and M. Napoli and M. Parente", booktitle = "Proceedings of the First Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010", volume = "25", publisher = "Electronic {P}roceedings in {T}heoretical {C}omputer {S}cience", pages = "132--145", doi = "10.4204/EPTCS.25.14", ) @proceedings(GTW2002, editor = "Erich Gr{\"a}del and Wolfgang Thomas and Thomas Wilke", year = "2002", title = "Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a {D}agstuhl seminar, February 2001]", series = "Lecture Notes in Computer Science", volume = "2500", publisher = "Springer", doi = "10.1007/3-540-36387-4", ) @book(HopcroftU79, author = "John E. Hopcroft and Jeffrey D. Ullman", year = "1979", title = "Introduction to Automata Theory, Languages, and Computation", publisher = "Addison Wesley", ) @article(Linna77, author = "Matti Linna", year = "1977", title = "A Decidability Result for Deterministic {\it omega}-Context-Free Languages", journal = "Theor. Comput. Sci.", volume = "4", number = "1", pages = "83--98", doi = "10.1016/0304-3975(77)90058-5", ) @inproceedings(LMS2004VPG, author = "Christof L{\"o}ding and Parthasarathy Madhusudan and Oliver Serre", year = "2004", title = "Visibly pushdown games", booktitle = "FSTTCS 2004", series = "Lecture Notes in Computer Science", volume = "3328", publisher = "Springer", pages = "408--420", doi = "10.1007/978-3-540-30538-5\_34", ) @inproceedings(LodingR12, author = "Christof L{\"o}ding and Stefan Repke", year = "2012", title = "{Regularity Problems for Weak Pushdown $\omega $-Automata and Games}", booktitle = "Mathematical Foundations of Computer Science 2012", series = "Lecture Notes in Computer Science", volume = "7464", publisher = "Springer Berlin / Heidelberg", pages = "764--776", doi = "10.1007/978-3-642-32589-2{\_}66", ) @book(PerrinP04, author = "Dominique Perrin and Jean-{\'E}ric Pin", year = "2004", title = "Infinite words", series = "Pure and Applied Mathematics", volume = "141", publisher = "Elsevier", ) @phdthesis(RepkeDiss, author = "Stefan Repke", year = "2014", title = "Simplification Problems for Automata and Games", school = "RWTH Aachen, Germany", ) @article(Senizergues01, author = "G{\'e}raud S{\'e}nizergues", year = "2001", title = "{L(A)=L(B)?} decidability results from complete formal systems", journal = "Theor. Comput. Sci.", volume = "251", number = "1-2", pages = "1--166", doi = "10.1016/S0304-3975(00)00285-1", ) @article(Staiger83, author = "Ludwig Staiger", year = "1983", title = "Finite-State $\omega $-Languages", journal = "JCSS", volume = "27", number = "3", pages = "434--448", url = "http://dx.doi.org/10.1016/0022-0000(83)90051-X", ) @article(Stearns67, author = "Richard E. Stearns", year = "1967", title = "A Regularity Test for Pushdown Machines", journal = "Information and Control", volume = "11", number = "3", pages = "323--340", doi = "10.1016/S0019-9958(67)90591-8", ) @mastersthesis(S2006DA, author = "Philipp Stephan", year = "2006", title = "Deterministic Visibly Pushdown Automata over Infinite Words", type = "Diploma thesis", school = "RWTH Aachen", ) @book(Straubing94, author = "Howard Straubing", year = "1994", title = "Finite Automata, Formal Logic, and Circuit Complexity", publisher = "Birkh\"{a}user", address = "Basel, Switzerland", doi = "10.1007/978-1-4612-0289-9", ) @article(Valiant75, author = "Leslie G. Valiant", year = "1975", title = "Regularity and Related Problems for Deterministic Pushdown Automata", journal = "J. ACM", volume = "22", number = "1", pages = "1--10", url = "http://doi.acm.org/10.1145/321864.321865", ) @phdthesis(Wadge84, author = "William W. Wadge", year = "1984", title = "Reducibility and Determinateness on the Baire Space", school = "University of California, Berkeley", ) @article(Walukiewicz01, author = "Igor Walukiewicz", year = "2001", title = "Pushdown Processes: Games and Model Checking", journal = "Information and Computation", volume = "164", number = "2", pages = "234--263", doi = "10.1006/inco.2000.2894", )