- Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures C. Aiswarya Pascal Baumann Prakash Saivasan Lia Schutze Georg Zetzsche Fri 09 January 2026
- The Parameterized Complexity of Learning Monadic Second-Order Logic Steffen van Bergerem Martin Grohe Nina Runde Fri 14 February 2025
- On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates Thomas Colcombet Alexander Rabinovich Fri 14 February 2025
- Numerical Document Queries Helmut Seidl Thomas Schwentick Anca Muscholl Thu 02 March 2023
- Extensions of MSO and the monadic counting hierarchy Juha Kontinen Hannu Niemistø Fri 01 July 2022
- Finite State Machines for Strings over Infinite Alphabets Frank Neven Thomas Schwentick Victor Vianu Tue 06 April 2021
- A representation theorem for (q-)holonomic sequences T. Kotek J. A. Makowsky Sun 04 October 2020
- Uniformisations of Regular Relations Over Bi-Infinite Words Grzegorz Fabiaundefinedski Michał Skrzypczak Szymon Toruundefinedczyk Sat 04 July 2020
- First-Order Tree-to-Tree Functions Mikołaj Bojaundefinedczyk Amina Doumane Sat 04 July 2020
- Logics for Weighted Timed Pushdown Automata Manfred Droste Vitaly Perevoshchikov Sat 26 December 2015
- An Extension of Muchnik's Theorem Achim Bluemnsath Stephan Kreutzer Fri 02 October 2015
- Thue Specifications and Their Monadic Second-order Properties Teodor Knapik Hugues Calbrix Mon 27 January 2014
- Recognizability, Hypergraph Operations, and Logical Types A. Blumensath B. Courcelle Thu 23 January 2014
- Logical specifications of infinite computations Wolfgang Thomas Helmut Lescow Mon 13 January 2014
- The Evaluation of First-order Substitution is Monadic Second-order Compatible Bruno Courcelle Teodor Knapik Fri 15 November 2013
- Forcing MSO on Infinite Words in Weak MSO Colin Riba Tue 09 July 2013
Library Size: 13G (16 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
