- PVASS Reachability is Decidable Roland Guttenberg Eren Keskin Roland Meyer Thu 10 April 2025
- Lexicographic transductions of finite words Emmanuel Filiot Pierre-Alain Reynier Nathan Lhote Sun 09 March 2025
- Recognizing Numbers Pranshu Gaba Arnab Sur Tue 25 February 2025
- Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests Roland Guttenberg Wojciech Czerwiński Sławomir Lasota Fri 14 February 2025
- Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton Günter Rote Tue 10 December 2024
- Equivalence of Deterministic Weighted Real-time One-Counter Automata Prince Mathew Vincent Penelle Prakash Saivasan A.~V. Sreejith Mon 25 November 2024
- Decidability Issues for Petri Nets -- a survey Javier Esparza Mogens Nielsen Thu 07 November 2024
- A Uniform Framework for Problems on Context-Free Grammars Javier Esparza Peter Rossmanith Stefan Schwoon Sat 02 November 2024
- A LOCAL View of the Polynomial Hierarchy Fabian Reiter Sat 26 October 2024
- mathbbN-polyregular functions arise from well-quasi-orderings Aliaume Lopez Fri 18 October 2024
- Reachability for Multi-Priced Timed Automata with Positive and Negative Rates Andrew Scoones Mahsa Shirmohammadi James Worrell Wed 31 July 2024
- Learning Closed Signal Flow Graphs Ekaterina Piotrovskaya Leo Lobski Fabio Zanasi Thu 04 July 2024
- Computing the Bandwidth of Meager Timed Automata Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclán Sun 23 June 2024
- Separability in Buchi Vass and Singly Non-Linear Systems of Inequalities Pascal Baumann Eren Keskin Roland Meyer Georg Zetzsche Fri 07 June 2024
- The Relational Machine Calculus Chris Barrett Daniel Castle Willem Heijltjes Wed 22 May 2024
- Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages Bharat Adsul Paul Gastin Shantanu Kulkarni Pascal Weil Wed 22 May 2024
- Functional Closure Properties of Finite mathbbN-weighted Automata Julian Dørfler Christian Ikenmeyer Wed 24 April 2024
- Commutative N-polyregular functions Aliaume Lopez Fri 05 April 2024
- Flattability of Priority Vector Addition Systems Roland Guttenberg Thu 29 February 2024
- Satisfiability of Context-free String Constraints with Subword-ordering and Transducers C Aiswarya Soumodev Mal Prakash Saivasan Fri 19 January 2024
- On the Boolean Closure of Deterministic Top-Down Tree Automata Christof Løding Wolfgang Thomas Thu 18 January 2024
- Place Bisimilarity is Decidable, Indeed Roberto Gorrieri Sat 25 November 2023
- Intensional Kleene and Rice Theorems for Abstract Program Semantics Paolo Baldan Francesco Ranzato Linpeng Zhang Mon 06 November 2023
- A Decidable Equivalence for a Turing-complete, Distributed Model of Computation Arnaldo Cesco Roberto Gorrieri Mon 06 November 2023
- On Learning Polynomial Recursive Programs Alex Buna-Marginean Vincent Cheval Mahsa Shirmohammadi James Worrell Thu 26 October 2023
- Word-Mappings of level 3 G. Sénizergues Thu 12 October 2023
- Bandwidth of Timed Automata: 3 Classes Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclan Thu 05 October 2023
- Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract) Jos C. M. Baeten Bas Luttik Thu 21 September 2023
- Weighted Automata over Vector Spaces Nada Damljanović Miroslav Ćirić Jelena Ignjatović Thu 14 September 2023
- Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata Mikołaj Bojańczyk Joanna Fijalkow Bartek Klin Joshua Moerman Tue 18 April 2023
- Regular Separability in Buchi VASS Pascal Baumann Roland Meyer Georg Zetzsche Thu 02 March 2023
- The Functional Machine Calculus II: Semantics Chris Barrett Willem Heijltjes Guy McCusker Tue 29 November 2022
- Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs Richard Mayr Eric Munday Sat 29 October 2022
- A Hierarchy of Nondeterminism Bader Abu Radi Orna Kupferman Ofer Leshkowitz Fri 23 September 2022
- Countdown mu-calculus Jędrzej Kołodziejski Bartek Klin Wed 03 August 2022
- Zone-based verification of timed automata: extrapolations, simulations and what next Patricia Bouyer Paul Gastin Frédéric Herbreteau Ocan Sankur B. Srivathsan Thu 21 July 2022
- Decision Questions for Probabilistic Automata on Small Alphabets Paul C. Bell Pavel Semukhin Wed 29 June 2022
- Synchronizable functions on integers Didier Caucal Chloé Rispal Tue 31 May 2022
- On the size of good-for-games Rabin automata and its link with the memory in Muller games Antonio Casares Thomas Colcombet Karoliina Lehtinen Wed 27 April 2022
- Logics Meet 2-Way 1-Clock Alternating Timed Automata Shankara Narayanan Krishna Khushraj Nanik Madnani Manuel Jr. Mazo Paritosh K. Pandya Wed 08 September 2021
- Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines Bruno Guillon Giovanni Pighizzini Luca Prigioniero Daniel Průša Wed 10 March 2021
- Reachability for Updatable Timed Automata made faster and more effective Paul Gastin Sayan Mukherjee B Srivathsan Wed 07 October 2020
- On the Expressive Power of Higher-Order Pushdown Systems Paweł Parys Tue 04 August 2020
- Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower Mrudula Balachander Shibashis Guha Jean-François Raskin Sat 18 July 2020
- Buchi automata recognizing sets of reals definable in first-order logic with addition and order Arthur Milchior Wed 12 February 2020
- Forward Analysis for WSTS, Part III: Karp-Miller Trees Michael Blondin Alain Finkel Jean Goubault-Larrecq Thu 07 November 2019
- Families of DFAs as Acceptors of ømega-Regular Languages Dana Angluin Udi Boker Dana Fisman Fri 09 August 2019
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases Bernard Boigelot Julien Brusten Veronique Bruyere Fri 31 May 2019
- On the Skolem Problem for Continuous Linear Dynamical Systems Ventsislav Chonev Joel Ouaknine James Worrell Tue 30 April 2019
- Efficient reduction of nondeterministic automata with application to language inclusion testing Lorenzo Clemente Richard Mayr Thu 07 March 2019
- Universal Safety for Timed Petri Nets is PSPACE-complete P. Aziz Abdulla M. Faouzi Atig R. Ciobanu R. Mayr P. Totzke Fri 23 November 2018
- Efficient reduction of nondeterministic automata with application to language inclusion testing L. Clemente R. Mayr Tue 20 November 2018
- Emptiness of Stack Automata is NEXPTIME-complete: A Correction C. Broadbent A. Carayol M. Hague O. Serre Mon 05 November 2018
- Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms L. Clemente S. Lasota Tue 01 May 2018
Library Size: 13G (54 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
