bibliographer

Positivity of Nearly Linearly Recurrent Sequences Amaury Pouly Mahsa Shirmohammadi James Worrell Wed 04 March 2026
The complexity of downward closures of indexed languages Richard Mandel Corto Mascle Georg Zetzsche Sun 01 February 2026
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes Florian Bruse Martin Lange Sun 01 February 2026
Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning Christof Løding Igor Walukiewicz Sun 01 February 2026
The memory of ømega-regular and BC(Sigma2^0) objectives Antonio Casares Pierre Ohlmann Fri 14 March 2025
Learning Deterministic One-Counter Automata in Polynomial Time Prince Mathew Vincent Penelle A.~V. Sreejith Sun 09 March 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
Weakly acyclic diagrams: A data structure for infinite-state symbolic verification Michael Blondin Michaël Cadilhac Xin-Yi Cui Philipp Czerner Javier Esparza Jakob Schulz Tue 10 December 2024
Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton Günter Rote Tue 10 December 2024
Learning real-time one-counter automata using polynomially many queries Prince Mathew Vincent Penelle A.~V. Sreejith Mon 25 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
A Myhill-Nerode style Characterization for Timed Automata With Integer Resets Kyveli Doveri Pierre Ganty B. Srivathsan Sat 12 October 2024
Presheaf automata Georg Struth Krzysztof Ziemiański Sat 12 October 2024
The single-use restriction for register automata and transducers over infinite alphabets Rafał Stefański Mon 15 July 2024
The Complexity of Simplifying ømega-Automata through the Alternating Cycle Decomposition Antonio Casares Corto Mascle Mon 01 July 2024
Computing the Bandwidth of Meager Timed Automata Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclán Sun 23 June 2024
Nominal Tree Automata With Name Allocation Simon Prucker Lutz Schrøder Tue 28 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
On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words Pavol Kebis Florian Luca Joel Ouaknine Andrew Scoones James Worrell Thu 16 May 2024
Half-positional ømega-regular languages Antonio Casares Pierre Ohlmann Thu 01 February 2024
On the Boolean Closure of Deterministic Top-Down Tree Automata Christof Løding Wolfgang Thomas Thu 18 January 2024
The Church Synthesis Problem with Parameters Alexander Rabinovich Sat 25 November 2023
On Learning Polynomial Recursive Programs Alex Buna-Marginean Vincent Cheval Mahsa Shirmohammadi James Worrell Thu 26 October 2023
Bandwidth of Timed Automata: 3 Classes Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclan Thu 05 October 2023
Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings Andreas Maletti Nils Oskar Nuernbergk Thu 14 September 2023
Weighted Automata over Vector Spaces Nada Damljanović Miroslav Ćirić Jelena Ignjatović Thu 14 September 2023
Coordination Sequences of Periodic Structures are Rational via Automata Theory Eryk Kopczynski Thu 03 August 2023
A Local-Time Semantics for Negotiations Madhavan Mukund Adwitee Roy B Srivathsan Sat 15 July 2023
A first-order logic characterization of safety and co-safety languages Alessandro Cimatti Luca Geatti Nicola Gigante Angelo Montanari Stefano Tonetta Fri 14 July 2023
Positive First-order Logic on Words and Graphs Denis Kuperberg Fri 26 May 2023
Singly Exponential Translation of Alternating Weak Buchi Automata to Unambiguous Buchi Automata Yong Li Sven Schewe Moshe Y. Vardi Wed 24 May 2023
Positive Data Languages Florian Frank Stefan Milius Henning Urbat Sat 29 April 2023
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata Mikołaj Bojańczyk Joanna Fijalkow Bartek Klin Joshua Moerman Tue 18 April 2023
On History-Deterministic One-Counter Nets Aditya Prakash K. S. Thejaswini Tue 25 October 2022
A Hierarchy of Nondeterminism Bader Abu Radi Orna Kupferman Ofer Leshkowitz Fri 23 September 2022
Natural Colors of Infinite Words Rudiger Ehlers Sven Schewe Tue 26 July 2022
Divide-and-Conquer Determinization of Buchi Automata based on SCC Decomposition Yong Li Andrea Turrini Weizhi Feng Moshe Y. Vardi Lijun Zhang Fri 01 July 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
From Regular to Strictly Locally Testable Languages Stefano Crespi Reghizzi Pierluigi San Pietro Fri 27 August 2021
Congruence Relations for Buchi Automata Yong Li Yih-Kuen Tsay Moshe Y. Vardi Mon 26 April 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
SD-Regular Transducer Expressions for Aperiodic Transformations Luc Dartois Paul Gastin Shankara Narayanan Krishna Thu 21 January 2021
On is an n-MCFL Kilian Gebhardt Frédéric Meunier Sylvain Salvati Sun 27 December 2020
Word equations in linear space Artur Jeż Mon 19 October 2020
Ambiguity Hierarchy of Regular Infinite Tree Languages Alexander Rabinovich Doron Tiferet Sat 12 September 2020
Implicit automata in typed łambda-calculi II: streaming transducers vs categorical semantics Nguyên Thành Dũng Lê Camille Noûs Pierre Pradic Tue 04 August 2020
On Succinctness and Recognisability of Alternating Good-for-Games Automata Udi Boker Denis Kuperberg Karoliina Lehtinen Michał Skrzypczak Wed 13 May 2020
Regular resynchronizability of origin transducers is undecidable Denis Kuperberg Jan Martens Wed 13 May 2020
On the Size of Finite Rational Matrix Semigroups Georgina Bumpus Christoph Haase Stefan Kiefer Paul-Ioan Stoienescu Jonathan Tanner Sun 19 April 2020
Minimising Good-for-Games automata is NP complete Sven Schewe Sun 29 March 2020
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra Mikołaj Bojańczyk Bartek Klin Fri 25 October 2019
Recompression: a simple and powerful technique for word equations Artur Jeż Thu 08 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
The height of piecewise-testable languages and the complexity of the logic of subwords Prateek Karandikar Philippe Schnoebelen Wed 08 May 2019
Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes S. J. v. Gool B. Steinberg Fri 16 November 2018
The Krohn-Rhodes Theorem and Local Divisors V. Diekert M. Kufleitner B. Steinberg Fri 16 November 2018
A Characterization for Decidable Separability by Piecewise Testable Languages Wojciech Czerwiński Wim Martens Lorijn van Rooijen Marc Zeitoun Georg Zetzsche Mon 12 November 2018
Emptiness of Stack Automata is NEXPTIME-complete: A Correction C. Broadbent A. Carayol M. Hague O. Serre Mon 05 November 2018
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence K. Asada N. Kobayashi R. Sin'ya T. Tsukada Tue 30 October 2018
Presburger arithmetic, rational generating functions, and quasi-polynomials K. Woods Mon 10 September 2018

Library Size: 13G (64 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]