- Quantum Circuit Verification - A Potential Roadmap (Invited Talk) Parosh Aziz Abdulla Yu-Fang Chen Michal Hečko Lukáš Holík Ondřej Lengál Jyun-Ao Lin Ramanathan Thinniyam Srinivasan Tue 17 February 2026
- Automatic Structures Achim Blumensath Erich Gradel Fri 31 October 2025
- On Cascades of Reset Automata Roberto Borelli Luca Geatti Marco Montali Angelo Montanari Fri 14 March 2025
- Discounted-Sum Automata with Real-Valued Discount Factors Udi Boker Mon 15 July 2024
- Synchronized Sequences Jeffrey Shallit Sat 26 August 2023
- Numerical Document Queries Helmut Seidl Thomas Schwentick Anca Muscholl Thu 02 March 2023
- Reasoning on Data Words over Numeric Domains Diego Figueira Anthony Widjaja Lin Mon 29 August 2022
- Stackless Processing of Streamed Trees Corentin Barloy Filip Murlak Charles Paperman Thu 15 July 2021
- Finite State Machines for Strings over Infinite Alphabets Frank Neven Thomas Schwentick Victor Vianu Tue 06 April 2021
- First-Order Tree-to-Tree Functions Mikołaj Bojaundefinedczyk Amina Doumane Sat 04 July 2020
- A Generalization of Cobham's Theorem to Automata over Real Numbers Bernard Boigelot Julien Brusten Wed 12 February 2020
- On Store Languages and Applications Oscar H. Ibarra Ian McQuillan Tue 19 March 2019
- Continuously analyzing finite, message-driven, time-synchronous component & connector systems during architecture evolution Arvid Butting Oliver Kautz Bernhard Rumpe Andreas Wortmann Mon 28 January 2019
- NFA reduction algorithms by means of regular inequalities J.-M. Champarnaud F. Coulon Thu 02 November 2017
- Boolean operations and inclusion test for attribute--element constraints Haruo Hosoya Makoto Murata Mon 23 January 2017
- Shuffle languages are in P Joanna Jędrzejowicz Andrzej Szepietowski Tue 10 January 2017
- Proof Spaces for Unbounded Parallelism Azadeh Farzan Zachary Kincaid Andreas Podelski Fri 11 November 2016
- Separability of Rational Relations in A^* times mathbb N^m by Recognizable Relations is Decidable Christian Choffrut Serge Grigorieff Mon 25 January 2016
- Unboundedness and Downward Closures of Higher-order Pushdown Automata Matthew Hague Jonathan Kochems C.-H. Luke Ong Sat 16 January 2016
- Left-most Derivation and Shadow-pushdown Automata for Context-sensitive Languages Benedek Nagy Mon 24 February 2014
- Thue Specifications and Their Monadic Second-order Properties Teodor Knapik Hugues Calbrix Mon 27 January 2014
- Factorisation Forests for Infinite Words Application to Countable Scattered Linear Orderings Thomas Colcombet Wed 08 January 2014
- Checking NFA Equivalence with Bisimulations Up to Congruence Filippo Bonchi Damien Pous Sat 28 December 2013
- Omega-Regular Half-Positional Winning Conditions Eryk Kopczyński Fri 27 December 2013
- The Tree Width of Auxiliary Storage P. Madhusudan Gennaro Parlato Mon 02 December 2013
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas Pablo Barceló Leonid Libkin Wed 13 November 2013
- On the Verification Problem of Nonregular Properties for Nonregular Processes Ahmed Bouajjani Rachid Echahed Peter Habermehl Mon 22 July 2013
Library Size: 13G (27 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
