- Parameterized Verification of Quantum Circuits Parosh Aziz Abdulla Yu-Fang Chen Michal Hečko Lukáš Holík Ondřej Lengál Jyun-Ao Lin Ramanathan S. Thinniyam Fri 09 January 2026
- Higher-Order Timed Automata and Tail Recursion Florian Bruse Tue 11 November 2025
- Multitree automata that count Denis Lugiez Fri 03 March 2023
- Alternating Tree Automata with Qualitative Semantics Raphael Berthon Nathanael Fijalkow Emmanuel Filiot Shibashis Guha Bastien Maubert Aniello Murano Laureline Pinault Sophie Pinchinat Sasha Rubin Olivier Serre Wed 24 March 2021
- Complexity of weak acceptance conditions in tree automata Jakub Neumann Andrzej Szepietowski Igor Walukiewicz Fri 07 February 2020
- Polymorphic Regular Tree Types and Patterns Jérôme Vouillon Mon 23 January 2017
- XDuce: A Statically Typed XML Processing Language Haruo Hosoya Benjamin C. Pierce Mon 23 January 2017
- Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata Lukáš Holík Ondřej Lengál Jiří Šimáček Tomáš Vojnar Tue 17 January 2017
- Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas Jérôme Champavère Rémi Gilleron Aurélien Lemay Joachim Niehren Mon 09 January 2017
- An Extension of Muchnik's Theorem Achim Bluemnsath Stephan Kreutzer Fri 02 October 2015
- Regular Sets of Descendants by Leftmost Strategy Pierre Réty Julie Vuotto Fri 02 May 2014
- Decidable call-by-need computations in term rewriting Irène Durand Aart Middeldorp Thu 16 January 2014
- The Complexity of Tree Automata and Logics of Programs E. Allen Emerson Charanjit S. Jutla Wed 18 December 2013
- Haskell overloading is DEXPTIME-complete Helmut Seidl Mon 14 October 2013
- Unambiguity and uniformization problems on infinite trees Marcin Bilkowski Michał Skrzypczak Tue 03 September 2013
- Uniform inevitability is tree automaton ineffable E. Allen Emerson Mon 22 July 2013
- Deciding emptiness for stack automata on infinite trees David Harel Danny Raz Mon 22 July 2013
- Reasoning about the past with two-way automata MosheY. Vardi Mon 22 July 2013
- Declaration-free type checking Prateek Mishra Uday S. Reddy Wed 17 July 2013
- Automata for XML---A survey Thomas Schwentick Mon 15 July 2013
- Logics for unranked trees: an overview Leonid Libkin Mon 15 July 2013
- Automata, Logic, and XML Frank Neven Mon 15 July 2013
- Tree automata with memory, visibility and structural constraints Hubert Comon-Lundh Florent Jacquemard Nicolas Perrin Mon 15 July 2013
- Streamable fragments of forward XPath Olivier Gauwin Joachim Niehren Mon 15 July 2013
- Visibly pushdown automata on trees: universality and u-universality Véronique Bruyère Marc Ducobu Olivier Gauwin Mon 15 July 2013
- Relating word and tree automata O. Kupferman S. Safra M. Y. Vardi Fri 12 July 2013
- Backward and forward bisimulation minimisation of tree automata Johanna Høgberg Andreas Maletti Jonathan May Tue 09 April 2013
- Bisimulation Minimization of Tree Automata ParoshAziz Abdulla Lisa Kaati Johanna Høgberg Tue 09 April 2013
- Computing simulations over tree automata: efficient techniques for reducing tree automata Parosh A. Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomáš Vojnar Tue 09 April 2013
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata Parosh A. Abdulla Lukas Holik Lisa Kaati Tomas Vojnar Tue 09 April 2013
- Composed Bisimulation for Tree Automata Parosh A. Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomas Vojnar Tue 09 April 2013
- Automata for the modal mu-calculus and related results David Janin Igor Walukiewicz Wed 27 March 2013
- Higher-Order Matching, Games and Automata C. Stirling Tue 19 February 2013
- Dependency Tree Automata Colin Stirling Tue 19 February 2013
- Automated temporal reasoning about reactive systems E. Allen Emerson Thu 31 January 2013
- Adding nesting structure to words Rajeev Alur P. Madhusudan Tue 22 January 2013
- Symbolic model checking with rich assertional languages Y. Kesten O. Maler M. Marcus A. Pnueli E. Shahar Sat 29 December 2012
- On the Myhill-Nerode Theorem for Trees Dexter Kozen Fri 30 November 2012
- The regular viewpoint on PA-processes D. Lugiez Ph. Schnoebelen Tue 27 November 2012
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs Javier Esparza Andreas Podelski Tue 27 November 2012
- Rigid tree automata and applications Florent Jacquemard Francis Klay Camille Vacher Fri 02 November 2012
- On regular tree languages and deterministic pushdown automata Jan Janoušek Bořivoj Melichar Fri 02 November 2012
- Visibly Pushdown Languages and Term Rewriting Jacques Chabin Pierre Réty Thu 11 October 2012
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata Ondřej Lengál Jiří Šimáček Tomáš Vojnar Fri 05 October 2012
- Tree Automata Techniques and Applications H. Comon M. Dauchet R. Gilleron C. Løding F. Jacquemard D. Lugiez S. Tison M. Tommasi Mon 01 October 2012
- Computing Simulations over Tree Automata Parosh Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomáš Vojnar Thu 13 September 2012
- Minimization of Tree Automata Thomas von Bomhard Mon 28 May 2012
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata Thomas Colcombet Christof Løding Sun 08 April 2012
- Safraless decision procedures O. Kupferman M.Y. Vardi Wed 04 April 2012
Library Size: 13G (49 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
